login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110576 Sequence is {a(0,n)}, where a(m,0)=1, a(m,n) = a(m,n-1) + a(m-1,n), a(0,n+1) = a(n,n). 4
1, 1, 2, 7, 29, 132, 648, 3407, 19109, 113946, 719896, 4802318, 33712717, 248285282, 1912928549, 15379305080, 128729241725, 1119519156562, 10097102345993, 94285391374568, 910145431036423, 9069616636456648, 93179779321299479 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Equals eigensequence of triangle A100100. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 02 2009]

FORMULA

a(0, n+1) = sum{k=0 to n} binomial(2n-k-1, n-1) a(0, k)

EXAMPLE

a(0,n): 1,1,2,7,29

a(1,n): 1,2,4,11

a(2,n): 1,3,7,18

a(3,n): 1,4,11,29

Since a(3,3) = 29, a(0,4) also is 29.

CROSSREFS

Cf. A110577, A110578, A110579, A110580.

A100100 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 02 2009]

Sequence in context: A200755 A132262 A007852 * A074600 A064641 A183608

Adjacent sequences:  A110573 A110574 A110575 * A110577 A110578 A110579

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Jul 28 2005

EXTENSIONS

More terms from Ryan Propper (rpropper(AT)stanford.edu), Sep 25 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.