login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A300404 Smallest integer k such that the largest term in the Goodstein sequence starting at k is > n. 2
2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

The sequence apparently grows very slowly.

Is the sequence unbounded?

LINKS

Table of n, a(n) for n=0..86.

Wikipedia, Goodstein's theorem

PROG

(PARI) \\ define the function bump() as in A059933

a(n) = my(k=1, x=k, step=2); while(1, x=bump(x, step)-1; step++; if(x > n, return(k)); if(x==0, k++; x=k; step=2))

CROSSREFS

Cf. A215409, A056193, A266204, A266205, A271554, A059933, A300402, A300403.

Sequence in context: A147968 A065167 A332298 * A175214 A095395 A029134

Adjacent sequences:  A300401 A300402 A300403 * A300405 A300406 A300407

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Mar 05 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 13:31 EDT 2021. Contains 347563 sequences. (Running on oeis4.)