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!)
A209935 G.f.: 1 = Sum_{n>=0} a(n)*x^n*Product_{k=1..n+1} (1-k^2*x) for n>0 with a(0)=1. 0
1, 1, 5, 66, 1735, 77587, 5339632, 527780778, 71236904519, 12635518401687, 2857729962091681, 804340796768258860, 276170316701087964628, 113757566198465278521124, 55424247710747076665462268, 31554099393732823158673973698 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..15.

EXAMPLE

G.f.: 1 = 1*(1-x) + 1*x*(1-x)*(1-2^2*x) + 5*x^2*(1-x)*(1-2^2*x)*(1-3^2*x) + 66*x^3*(1-x)*(1-2^2*x)*(1-3^2*x)*(1-4^2*x) + 1735*x^4*(1-x)*(1-2^2*x)*(1-3^2*x)*(1-4^2*x)*(1-5^2*x) +...

PROG

(PARI) {a(n)=if(n==0, 1, polcoeff(1-sum(k=0, n-1, a(k)*x^k*prod(j=1, k+1, 1-j^2*x+x*O(x^n))), n))}

for(n=0, 20, print1(a(n), ", "))

CROSSREFS

Cf. A082161.

Sequence in context: A219678 A297743 A279463 * A156597 A059489 A197161

Adjacent sequences:  A209932 A209933 A209934 * A209936 A209937 A209938

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Mar 15 2012

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 January 25 22:56 EST 2020. Contains 331270 sequences. (Running on oeis4.)