Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153338
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A153338 Number of zig-zag paths from top to bottom of a 2n-1 by 2n-1 square whose color is not that of the top right corner +0
5
0, 2, 18, 116, 650, 3372, 16660, 79592, 371034, 1697660, 7654460, 34106712, 150499908, 658707896, 2863150440, 12371226064, 53178791162, 227561427612, 969890051884, 4119092850680, 17438036501676, 73611934643368 (list; graph; listen)
OFFSET

1,2

LINKS

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

FORMULA

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

CROSSREFS

A102699, A153334, A153335, A153336, A153337

Sequence in context: A038721 A064837 A027433 this_sequence A007798 A058052 A119578

Adjacent sequences: A153335 A153336 A153337 this_sequence A153339 A153340 A153341

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research