Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059115 Expansion of ((1-x)/(1-2*x))*exp(x/(1-x)). +0
3
1, 2, 9, 58, 485, 4986, 60877, 861554, 13878153, 250854130, 5030058161, 110837000682, 2662669300909, 69270266115818, 1940260799150325, 58220372514830626, 1863293173842259217, 63356877145370671074 (list; graph; listen)
OFFSET

0,2

COMMENT

L'(n,i) are unsigned Lah numbers (Cf. A008297):L'(n,i)=n!/i!*binomial(n-1,i-1) for i >= 1, L'(0,0)=1, L'(n,0)=0 for n>0.

FORMULA

Sum_{m=0..n} Sum_{i=0..n} L'(n, i)*Product_{j=1..m} (i-j+1).

Given g.f. A(x), then g.f. A000522 = A(x/(1+x)). - Michael Somos Aug 03 2006

EXAMPLE

(1-x)/(1-2*x)*exp(x/(1-x))=1+2*x+9/2*x^2+29/3*x^3+485/24*x^4+831/20*x^5+...

MAPLE

s := series((1-x)/(1-2*x)*exp(x/(1-x)), x, 21): for i from 0 to 20 do printf(`%d, `, i!*coeff(s, x, i)) od:

PROGRAM

(PARI) {a(n)=if(n<0, 0, n!*polcoeff( (1-x)/(1-2*x)*exp(x/(1-x)+x*O(x^n)), n))} /* Michael Somos Aug 03 2006 */

(PARI) {a(n)=local(A); if(n<0, 0, n++; A=vector(n); A[n]=1; for(k=1, n-1, A[n-k]=1; if(k>1, A[n-k+1]=A[n-k+2]); for(i=n-k+1, n, A[i]=A[i-1]+k*A[i])); A[n])} /* Michael Somos Aug 03 2006 */

CROSSREFS

Row sums of A059114, A059110, A049020, A001861, A059099, A052897.

Sequence in context: A116867 A132608 A080834 this_sequence A156129 A005364 A151616

Adjacent sequences: A059112 A059113 A059114 this_sequence A059116 A059117 A059118

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 06 2001

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research