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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025239 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-2)*a(2) for n >= 3. 1
2, 3, 6, 21, 78, 318, 1356, 5997, 27222, 126138, 594132, 2836290, 13692300, 66729180, 327855768, 1622216829, 8076311142, 40427919714, 203353800324, 1027318915254, 5210182030308, 26517609163812, 135397544040744, 693364054299474 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..200

FORMULA

G.f.: (1-sqrt(1-4*x-8*x^2))/2. - Michael Somos, Jun 08 2000

Recurrence (for n>3): n*a(n) = 2*(2*n-3)*a(n-1) + 8*(n-3)*a(n-2). - Vaclav Kotesovec, Oct 07 2012

a(n) ~ sqrt(3-sqrt(3))*(2+2*sqrt(3))^n/(4*sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, Oct 07 2012

MATHEMATICA

Join[{2}, Drop[CoefficientList[Series[(1-Sqrt[1-4x-8x^2])/2, {x, 0, 30}], x], 2]] (* Harvey P. Dale, Nov 05 2011 *)

PROG

(PARI) a(n)=polcoeff((1-sqrt(1-4*x-8*x^2+x*O(x^n)))/2, n)

CROSSREFS

Essentially the same as A025229.

Sequence in context: A238895 A125601 A292811 * A127294 A012924 A024485

Adjacent sequences:  A025236 A025237 A025238 * A025240 A025241 A025242

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 02:57 EST 2019. Contains 320364 sequences. (Running on oeis4.)