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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085139 a(0)=1, for n>0: a(n)=(1/2) Sum( Sum( a(j)a(i-j), (j=0..i)) (1+(-1)^(n+1+i)), (i=0..n)). 0
1, 1, 2, 6, 18, 58, 194, 670, 2370, 8546, 31298, 116102, 435346, 1647418, 6283394, 24130174, 93226242, 362098050, 1413098370, 5538138182, 21788069266, 86016385274, 340655956802, 1353023683486, 5388230857538, 21510345134178 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

G.f.: A(x)=(1/(2x))(1 - x^2 - Sqrt[(1 - x^2)^2 - 4x(1 - x^2)])

G.f.: c(x/(1-x^2)) where c(x) is the g.f. of A000108. - Paul Barry (pbarry(AT)wit.ie), Apr 12 2005

G.f.: 1/(1-z/(1-z/(1-z/(...)))) where z=x/(1-x^2) (continued fraction); this is a special case of the previous formula. [Joerg Arndt, Mar 18 2011]

a(n)=sum{k=0..floor(n/2), C(n-k,k)C(n-2k)}-sum{k=0..,floor((n-2)/2), C(n-k-2,k)C(n-2k-2)}; [From Paul Barry (pbarry(AT)wit.ie), Nov 30 2008]

Contribution from Paul Barry (pbarry(AT)wit.ie), May 27 2009: (Start)

G.f.: 1+x/(1-2x-2x^2/(1-x-2x^2/(1-2x-x^2/(1-2x-2x^2/(1-x-2x^2/(1-2x-x^2/(1-2x-2x^2/(1-x-2x^2/(1-... (continued fraction).

a(n)=0^n+sum{k=0..floor((n-1)/2), C(n-k-1,k)*A000108(n-2k)}. (End)

G.f.: M(F(x))) where F(x) is the g.f. of A000045, M(x) is the g.f. A001006 [From Kruchinin Vladimir (kru(AT)ie.tusur.ru), Sep 06 2010]

MATHEMATICA

a[n_] := a[n] = (1/2)Sum[Sum[a[j]a[i -j], {j, 0, i}](1 + (-1)^(n+1+i)), {i, 0, n}]; a[0] = 1; Table[a[n], {n, 0, 10}]

CROSSREFS

Sequence in context: A151282 A193777 A157004 * A150041 A190790 A150042

Adjacent sequences:  A085136 A085137 A085138 * A085140 A085141 A085142

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jun 20 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 16 07:39 EST 2012. Contains 205881 sequences.