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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085362 a(0)=1, for n>0: a(n)=2*5^(n-1)-(1/2)Sum a(i)a(n-i),(i=1,..,n-1). 5
1, 2, 8, 34, 150, 678, 3116, 14494, 68032, 321590, 1528776, 7301142, 35003238, 168359754, 812041860, 3926147730, 19022666310, 92338836390, 448968093320, 2186194166950, 10659569748370, 52037098259090, 254308709196660 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Sum(Sum a(j)a(i-j),(j=0,..,i)),(i=0,..,n)=5^n

Number of bilateral Schroeder paths (i.e. lattice paths consisting of steps U=(1,1), D=(1,-1) and H=(2,0)) from (0,0) to (2n,0) and with no H-steps at even (zero, positive or negative) levels. Example: a(2)=8 because we have UDUD, UUDD, UHD, UDDU and their reflections in the x-axis. First differences of A026375. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jan 28 2004

FORMULA

G.f.: A(x)=sqrt((1-x)/(1-5x))

a(n)=[2(3n-2)a(n-1)-5(n-2)a(n-2)]/n; a(0)=1, a(1)=2. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jan 28 2004

MATHEMATICA

CoefficientList[Series[Sqrt[(1-x)/(1-5x)], {x, 0, 25}], x]

CROSSREFS

Cf. A026375.

Bisection of A026392. Cf. A026375.

Cf. A026387. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 12 2008]

Sequence in context: A067336 A151829 A026387 * A150889 A150890 A150891

Adjacent sequences:  A085359 A085360 A085361 * A085363 A085364 A085365

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jun 25 2003

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 17 09:41 EST 2012. Contains 206009 sequences.