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.

A165327 E.g.f: Sum_{n>=0} 2^(n(n-1)) * exp(2^n*x) * x^n/n!.

Original entry on oeis.org

1, 2, 9, 125, 6561, 1419857, 1291467969, 4902227890625, 76686282021340161, 4891005035897482905857, 1262332172765951010966606849, 1312086657801266767978668212890625
Offset: 0

Views

Author

Paul D. Hanna, Sep 15 2009

Keywords

Comments

More generally, Sum_{n>=0} m^n * q^(n^2) * exp(b*q^n*x) * x^n/n! = Sum_{n>=0} (m*q^n + b)^n * x^n/n! for all q, m, b.

Examples

			E.g.f: A(x) = 1 + 2*x + 3^2*x^2/2! + 5^3*x^3/3! + 9^4*x^4/4! +...
A(x) = exp(x) + exp(2x)*x + 2^2*exp(4x)*x^2/2! + 2^6*exp(8x)*x^3/3! +...
This is a special case of the more general statement:
Sum_{n>=0} m^n * F(q^n*x)^b * log(F(q^n*x) )^n / n! = Sum_{n>=0} x^n * [y^n] F(y)^(m*q^n + b) where F(x) = exp(x), q=2, m=1/2, b=1.
		

Crossrefs

Cf. variants: A136516, A055601, A079491.

Programs

  • PARI
    {a(n,q=2,m=1/2,b=1)=n!*polcoeff(sum(k=0, n, m^k*q^(k^2)*exp(b*q^k*x+x*O(x^n))*x^k/k!), n)}

Formula

a(n) = (2^(n-1) + 1)^n.