Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153337
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153337 Number of zig-zag paths from top to bottom of a 2n-1 by 2n-1 square whose color is that of the top right corner +0
5
1, 4, 24, 136, 720, 3624, 17584, 83024, 383904, 1746280, 7839216, 34812144, 153204064, 669108496, 2903267040, 12526343584, 53779871552, 229895033832, 978965187184, 4154438114480, 17575883030496, 74150192517808 (list; graph; listen)
OFFSET

1,2

LINKS

Joseph Myers, BMO 2008--2009 Round 1 Problem 1---Generalisation

FORMULA

a(n) = (n)2^(2n-2) - 2(n-1)binomial(2n-2,n-1)

CROSSREFS

A102699, A153334, A153335, A153336, A153338

Sequence in context: A048180 A057391 A071079 this_sequence A122690 A005319 A155119

Adjacent sequences: A153334 A153335 A153336 this_sequence A153338 A153339 A153340

KEYWORD

easy,nonn

AUTHOR

Joseph Myers (jsm(AT)polyomino.org.uk), Dec 24 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research