The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 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; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = n*2^(2n-2) - 2(n-1)*binomial(2n-2,n-1).
EXAMPLE
a(3) = 3 * 2 ^ (2*3 - 2) - 2* (3 - 1) * binomial(2*3 - 2, 3 - 1) = 24. - Indranil Ghosh, Feb 19 2017
MATHEMATICA
Table[(n)2^(2n-2)-2(n-1) Binomial[2n-2, n-1], {n, 1, 22}] (* Indranil Ghosh, Feb 19 2017 *)
PROG
(Python)
import math
def C(n, r):
....f=math.factorial
....return f(n)/f(r)/f(n-r)
def A153337(n):
....return str(n*2**(2*n-2)-2*(n-1)*C(2*n-2, n-1)) # Indranil Ghosh, Feb 19 2017
(PARI) a(n) = n*2^(2*n-2) - 2*(n-1)*binomial(2*n-2, n-1); \\ Michel Marcus, Feb 19 2017
CROSSREFS
Sequence in context: A048180 A057391 A071079 * A122690 A183512 A364277
KEYWORD
easy,nonn
AUTHOR
Joseph Myers, Dec 24 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 22:36 EDT 2024. Contains 372954 sequences. (Running on oeis4.)