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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138910 Inverse binomial transform of A138909. 1
1, 1, 3, 20, 129, 1164, 12265, 151458, 2136337, 33901640, 597761361, 11593851510, 245310524041, 5622982528188, 138803996674057, 3671135646515834, 103568483199034785, 3104443346427521808, 98528857134710517793 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

O.g.f. satisfies: [x^n] A( x/(1+(n-1)*x) )/(1+(n-1)*x) = n! for n>=0.

E.g.f. satisfies: [x^n] A(x)*exp(-(n-1)*x) = 1 for n>=0.

PROG

(PARI) {a(n)=local(A=[1]); for(k=1, n, A=concat(A, 0); A[k+1]=k!-polcoeff(subst(Ser(A), x, x/(1+(k-1)*x+x*O(x^k)))/(1+(k-1)*x), k)); A[n+1]}

CROSSREFS

Cf. A138909.

Sequence in context: A037795 A187442 A167590 * A000276 A056306 A056298

Adjacent sequences:  A138907 A138908 A138909 * A138911 A138912 A138913

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 05 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 16:51 EST 2012. Contains 205938 sequences.