Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138910 Inverse binomial transform of A138909. +0
2
1, 1, 3, 20, 129, 1164, 12265, 151458, 2136337, 33901640, 597761361, 11593851510, 245310524041, 5622982528188, 138803996674057, 3671135646515834, 103568483199034785, 3104443346427521808, 98528857134710517793 (list; graph; listen)
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.

PROGRAM

(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: A009125 A037795 A167590 this_sequence A000276 A056306 A056298

Adjacent sequences: A138907 A138908 A138909 this_sequence A138911 A138912 A138913

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research