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.

A092123 Largest coefficient in expansion of P(0)=x, P(n+1)=P(n)*[1+P(n)].

Original entry on oeis.org

1, 1, 2, 10, 302, 391232, 912140731560, 6870302396056798235043564, 552249828443015013351729477795257932661645918815144
Offset: 0

Views

Author

Ralf Stephan, Apr 02 2004

Keywords

Comments

It would be nice to have a formula for the 2^(n-1)th coefficient.
The exponent of x in P(n) with a(n) as coefficient is {1,1,2,5,9,19,37,74,147,294,587,1175,...}.

Crossrefs

Cf. A016131.

Programs

  • PARI
    P(n)=if(n<1,x,P(n-1)*(P(n-1)+1))
    
  • PARI
    a(n)=vecmax(Vec(P(n)))