The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025275 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5. 0
1, 0, 1, 0, 0, 1, 2, 4, 10, 24, 56, 133, 318, 760, 1822, 4384, 10576, 25578, 62020, 150744, 367220, 896496, 2193104, 5375405, 13199606, 32468912, 80000438, 197423104, 487921440, 1207578750, 2992704924, 7426194328, 18449964876, 45890849360 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
FORMULA
Conjecture: n*a(n) +2*(-2*n+3)*a(n-1) +4*(n-3)*a(n-2) +2*(-2*n+9)*a(n-3) +8*(n-6)*a(n-4)=0. - R. J. Mathar, May 30 2014
G.f.: 1/2 - sqrt(8*x^4-4*x^3+4*x^2-4*x+1)/2. - Vaclav Kotesovec, Jan 25 2015
MATHEMATICA
nmax = 30; aa = ConstantArray[0, nmax]; aa[[1]] = 1; aa[[2]] = 0; aa[[3]] = 1; aa[[4]] = 0; Do[aa[[n]] = Sum[aa[[k]]*aa[[n-k]], {k, 1, n-1}], {n, 5, nmax}]; aa (* Vaclav Kotesovec, Jan 25 2015 *)
CROSSREFS
Sequence in context: A190794 A052912 A024740 * A165409 A052542 A163271
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)