Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153339
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153339 Number of zig-zag paths from top to bottom of a rectangle of width 5 with n rows whose color is that of the top right corner +0
1
3, 4, 8, 12, 24, 36, 72, 108, 216, 324, 648, 972, 1944, 2916, 5832, 8748, 17496, 26244, 52488, 78732, 157464, 236196, 472392, 708588, 1417176, 2125764, 4251528, 6377292, 12754584, 19131876, 38263752, 57395628, 114791256, 172186884 (list; graph; listen)
OFFSET

1,1

LINKS

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

FORMULA

a(2n) = 4*3^(n-1), a(1) = 3, a(2n+1) = 8*3^(n-1) for n >= 1

CROSSREFS

Sequence in context: A147622 A052952 A074331 this_sequence A033955 A049720 A078172

Adjacent sequences: A153336 A153337 A153338 this_sequence A153340 A153341 A153342

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research