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!)
A120958 Sequence uniquely defined by: (n-1)*a(n) = n*[x^n] B(x) for n>1 with a(0)=a(1)=1, or, equivalently, 1+x - A(x) + x*A'(x) = x*B'(x), where B(x) = x/series_reversion(x*A(x)). 1
1, 1, 2, 12, 164, 3780, 128220, 5962180, 363377640, 28109659104, 2692076369460, 312824482316588, 43373419550214360, 7074801917270302072, 1341285553197404432856, 292488135377674745120280 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(n) is divisible by n for n>0.
LINKS
FORMULA
The g.f. of A120957 equals B(x) = x/series_reversion(x*A(x)), so that both A(x) = B(x*A(x)) and B(x) = A(x/B(x)) equivalently hold.
PROG
(PARI) {a(n)=local(A=[1, 1]); if(n==0|n==1, 1, for(i=1, n, A=concat(A, 0); A[ #A]=(#A-2)*Vec(serreverse(x/Ser(A)))[ #A]); A[n+1]*n/(n-1))}
CROSSREFS
Sequence in context: A302688 A201007 A226058 * A030163 A368981 A255163
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jul 21 2006
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 April 23 08:19 EDT 2024. Contains 371905 sequences. (Running on oeis4.)