cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A159313 G.f.: 1/Product_{n>=1} (1 - a(n)*x^n/n!) = Sum_{n>=0} (n+1)^(n-1)*x^n/n!.

Original entry on oeis.org

1, 1, 7, 55, 601, 7136, 116929, 1985607, 42814321, 954103114, 25933795801, 717297529686, 23297606120881, 770246625909788, 29137514248718373, 1127405063005559911, 48661170952876980481, 2139268956511467712586, 104127343895537535804841, 5158373570420037618149856
Offset: 1

Views

Author

Vladeta Jovovic and Paul D. Hanna, Apr 17 2009

Keywords

Examples

			G.f.: W(x) = 1/[(1-x)*(1-x^2/2!)*(1-7*x^3/3!)*(1-55*x^4/4!)*(1-601*x^5/5!)*...]
where W(x) = 1 + x + 3*x^2/2! + 4^2*x^3/3! + 5^3*x^4/4! + 6^4*x^5/5! + ...
and W(x/exp(x)) = exp(x) and exp(x*W(x)) = W(x) = LambertW(-x)/(-x).
		

Crossrefs

Cf. A159310.

Programs

  • Mathematica
    a[n_] :=  a[n] = n^(n-1) - (n-1)! * DivisorSum[n, #*(a[#]/#!)^(n/#) &, #Amiram Eldar, Aug 18 2023 *)
  • PARI
    {a(n)=if(n<1, 0, if(n==1, 1,n^(n-1) - (n-1)!*sumdiv(n, d, if(d
    				
  • PARI
    {a(n)=if(n<1, 0, n!*polcoeff(sum(k=0,n+1,(k+1)^(k-1)*x^k/k!)*prod(k=1, n-1, 1-a(k)*x^k/k! +x*O(x^n)), n))}

Formula

a(n) = n^(n-1) - (n-1)!*[ Sum_{d divides n, d1 with a(1)=1.
G.f.: Sum_{n>=1} -log(1 - a(n)*x^n/n!) = Sum_{n>=1} n^(n-1)*x^n/n! = -LambertW(-x).
G.f.: Sum_{n>=1} -log(1 - a(n)*exp(-n*x)*x^n/n!) = x.
G.f.: Sum_{n>=1} n*a(n)*x^n/[n! - a(n)*x^n] = Sum_{n>=1} n^n*x^n/n!.
G.f.: Sum_{n>=1} n*a(n)*x^n/[n!*exp(nx) - a(n)*x^n] = x/(1-x).

Extensions

a(19)-a(20) from Amiram Eldar, Aug 18 2023
Showing 1-1 of 1 results.