A300404 Smallest integer k such that the largest term in the Goodstein sequence starting at k is > n.

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

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: A366320 A065167 A332298 * A175214 A368700 A095395

Adjacent sequences: A300401 A300402 A300403 * A300405 A300406 A300407

Keyword

nonn

Author

Felix Fröhlich, Mar 05 2018

Status

approved