login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025264 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4. 1
2, 1, 1, 5, 22, 99, 450, 2067, 9586, 44852, 211570, 1005427, 4810460, 23157904, 112110906, 545524287, 2666864340, 13092764136, 64527778938, 319157531592, 1583724160896, 7882364163954, 39339994155288, 196843821874407, 987272738842392 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..25.

FORMULA

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

Recurrence: n*a(n) = 4*(2*n-3)*a(n-1) - 12*(n-3)*a(n-2) - 6*(2*n-9)*a(n-3). - Vaclav Kotesovec, Jan 25 2015

MATHEMATICA

nmax = 30; aa = ConstantArray[0, nmax]; aa[[1]] = 2; aa[[2]] = 1; aa[[3]] = 1; Do[aa[[n]] = Sum[aa[[k]] * aa[[n-k]], {k, 1, n-1}], {n, 4, nmax}]; aa (* Vaclav Kotesovec, Jan 25 2015 *)

PROG

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

CROSSREFS

Cf. A025266.

Sequence in context: A174986 A327671 A036563 * A321716 A245567 A204168

Adjacent sequences:  A025261 A025262 A025263 * A025265 A025266 A025267

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 June 6 17:01 EDT 2020. Contains 334829 sequences. (Running on oeis4.)