Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138912
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138912 Inverse binomial transform of A138911. +0
2
1, 1, 2, 9, 28, 145, 726, 4249, 27000, 186561, 1387450, 11034001, 93295236, 834720913, 7870851366, 77943848025, 808159323376, 8749874083585, 98687599614450, 1157060036429857, 14075106913366140, 177337182574590801 (list; graph; listen)
OFFSET

0,3

COMMENT

The n-th term of the n-th inverse binomial transform of A138911 is 1 for n>=0.

FORMULA

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

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

PROGRAM

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

CROSSREFS

Cf. A138911 (binomial transform).

Sequence in context: A002532 A098518 A086511 this_sequence A002747 A110377 A041877

Adjacent sequences: A138909 A138910 A138911 this_sequence A138913 A138914 A138915

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research