Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092123
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092123 Largest coefficient in expansion of P(0)=x, P(n+1)=P(n)*[1+P(n)]. +0
4
1, 1, 2, 10, 302, 391232, 912140731560, 6870302396056798235043564, 552249828443015013351729477795257932661645918815144 (list; graph; listen)
OFFSET

0,3

COMMENT

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,...}.

PROGRAM

(PARI) P(n)=if(n<1, x, P(n-1)*(P(n-1)+1))

(PARI) a(n)=vecmax(Vec(P(n)))

CROSSREFS

Cf. A016131.

Sequence in context: A161181 A073834 A111837 this_sequence A079278 A015178 A013034

Adjacent sequences: A092120 A092121 A092122 this_sequence A092124 A092125 A092126

KEYWORD

nonn

AUTHOR

Ralf Stephan, Apr 02 2004

page 1

Search completed in 0.004 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research