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.

A158110 G.f.: A(x) = exp( Sum_{n>=1} 2^(n^3)*x^n/n ).

Original entry on oeis.org

1, 2, 130, 44739500, 4611686018516874838, 8507059173023461595807737228465099196, 17552048611426197782986337964292523732529439672780432120964458900
Offset: 0

Views

Author

Paul D. Hanna, Mar 19 2009

Keywords

Comments

Conjecture: given q and m are nonnegative integers, then
exp( Sum_{n>=1} q^(n^m)*x^n/n )
is a power series in x with integer coefficients.

Examples

			G.f.: A(x) = 1 + 2*x + 130*x^2 + 44739500*x^3 +...
log(A(x)) = 2*x + 2^8*x^2/2 + 2^27*x^3/3 + 2^64*x^4/4 +...
		

Crossrefs

Cf. A155200.

Programs

  • PARI
    {a(n)=polcoeff(exp(sum(m=1, n+1, 2^(m^3)*x^m/m)+x*O(x^n)), n)}