A271989 -id:A271989 - cp's OEIS frontend

A137411 Weak Goodstein sequence starting at 11.

11, 30, 67, 127, 217, 343, 511, 636, 775, 928, 1095, 1276, 1471, 1680, 1903, 2139, 2389, 2653, 2931, 3223, 3529, 3849, 4183, 4531, 4893, 5269, 5659, 6063, 6481, 6913, 7359, 7818, 8291, 8778, 9279, 9794, 10323, 10866, 11423, 11994, 12579, 13178

Offset: 0

Nicholas Matteo (kundor(AT)kundor.org), Apr 15 2008

The sequence eventually goes to zero, as can be seen by noting that multiples of the highest exponent (3 in this case) only go down; in fact the 8th term, a(8) = 7*8^2 + 7*8 + 7 = 511; after which the multiple of the square term will only go down, etc.
This sequence, for 11, grows beyond the quintillions of digits before going to zero.
From Zhuorui He, Aug 07 2025: (Start)
For more info see A266201-A266202.
This sequence has A266203(11)+1 terms and a(A266203(11))=0 is the last term of this sequence. The maximum term in this sequence is a((A266203(11)-1)/2)=(A266203(11)+1)/2. 10^^8 < A266203(11) < 10^^9.
More precisely, 10^(10^(10^(10^(10^(10^(10^619.29937)))))) < A266203(11) < 10^(10^(10^(10^(10^(10^(10^619.299371)))))). (End)

			a(0) = 11 = 2^3 + 2^1 + 2^0
a(1) = 3^3 + 3^1 + 3^0 - 1 = 30
a(2) = 4^3 + 4^1 - 1 = 4^3 + 3*4^0 = 67

K. Hrbacek and T. Jech, Introduction to Set Theory, Taylor & Francis Group, 1999, pp. 125-127.

Zhuorui He, Table of n, a(n) for n = 0..10000 (Terms 0..998 from Harvey P. Dale)

Cf. A056004 (strong Goodstein sequences), A059933 (strong Goodstein sequence for 16.).

Weak Goodstein sequences: A267647: g_n(4); A267648: g_n(5); A271987: g_n(6); A271988: g_n(7); A271989: g_n(8); A271990: g_n(9); A271991: g_n(10); A137411: g_n(11); A271992: g_n(16); A265034: g_n(266); A266202: g_n(n); A266203: a(n)=k such that g_k(n)=0;

nxt[{n_,a_}]:={n+1,FromDigits[IntegerDigits[a,n+1],n+2]-1}; Transpose[ NestList[ nxt,{1,11},50]][[2]] (* Harvey P. Dale, Feb 09 2015 *)

a(n, m=11) = { my(wn = m); for (k=2, n+1, wn = fromdigits(digits(wn, k), k+1) - 1); wn; } \\ Zhuorui He, Aug 08 2025

To obtain a(n + 1), write a(n) in base n + 2, increase the base to n + 3 and subtract 1.

Offset changed to 0 by Zhuorui He, Aug 07 2025

A056041 Value for which b(a(n))=0 when b(2)=n and b(k+1) is calculated by writing b(k) in base k, reading this as being written in base k+1 and then subtracting 1.

Original entry on oeis.org

2, 3, 5, 7, 23, 63, 383, 2047

Offset: 0

Henry Bottomley, Aug 04 2000

a(8)=3*2^(3*2^27+27)-1 which is more than 10^(10^8) and equal to the final base of the Goodstein sequence starting with g(2)=4; indeed, apart from the initial term, the sequence starting with b(2)=8 is identical to the Goodstein sequence starting with g(2)=4. The initial terms of a(n) [2, 3, 5 and 7] are equal to the initial terms of the equivalent final bases of Goodstein sequences starting at the same points. a(9)=2^(2^(2^70+70)+2^70+70)-1 which is more than 10^(10^(10^20)).
It appears that if n is even then a(n) is one less than three times a power of two, while if n is odd then a(n) is one less than a power of two.
Comment from John Tromp, Dec 02 2004: The sequence 2,3,5,7,3*2^402653211 - 1, ... gives the final base of the Goodstein sequence starting with n. This is an example of a very rapidly growing function that is total (i.e. defined on any input), although this fact is not provable in first-order Peano Arithmetic. See the links for definitions. This grows even faster than the Friedman sequence described in the Comments to A014221.
In fact there are two related sequences: (i) The Goodstein function l(n) = number of steps for the Goodstein sequence to reach 0 when started with initial term n >= 0: 0, 1, 3, 5, 3*2^402653211 - 3, ...; and (ii) the same sequence + 2: 2, 3, 5, 7, 3*2^402653211 - 1, ..., which is the final base reached. Both grow too rapidly to have their own entries in the database.
Related to the hereditary base sequences - see cross-reference lines.
This sequence gives the final base of the weak Goodstein sequence starting with n; compare A266203, the length of the weak Goodstein sequence. a(n) = A266203(n) + 2.

			a(3)=7 because starting with b(2)=3=11 base 2, we get b(3)=11-1 base 3=10 base 3=3, b(4)=10-1 base 4=3, b(5)=3-1 base 5=2, b(6)=2-1 base 6=1 and b(7)=1-1 base 7=0.

R. L. Goodstein, On the Restricted Ordinal Theorem, J. Symb. Logic 9, 33-41, 1944.
L. Kirby, and J. Paris, Accessible independence results for Peano arithmetic, Bull. London Mathematical Society, 14 (1982), 285-293.
J. Tromp, Programming Pearls
Eric Weisstein's World of Mathematics, Goodstein Sequence
Wikipedia, Goodstein's theorem

Cf. A266202, A268687, A268689, A268688.
Equals A266203 + 2.
Weak Goodstein sequences: A267647, A267648, A271987, A271988, A271989, A271990, A271991, A137411, A271992, A265034.
Steps of strong Goodstein sequences: A056004, A057650, A059934, A059935, A059936, A271977.
Strong Goodstein sequences: A215409, A056193, A266204, A222117, A059933.
Woodall numbers: A003261.

A271991 g_n(10) where g is the weak Goodstein function defined in A266202.

Original entry on oeis.org

10, 29, 65, 125, 215, 284, 363, 452, 551, 660, 779, 907, 1045, 1193, 1351, 1519, 1697, 1885, 2083, 2291, 2509, 2737, 2975, 3222, 3479, 3746, 4023, 4310, 4607, 4914, 5231, 5558, 5895, 6242, 6599, 6966, 7343, 7730, 8127, 8534, 8951

Offset: 0

Natan Arie Consigli, May 22 2016

For more info see A266201-A266202.

Cf. A271557: G_n(10).

Weak Goodstein sequences: A137411: g_n(11); A265034: g_n(266); A267647: g_n(4); A267648: g_n(5); A271987: g_n(6); A271988: g_n(7); A271989: g_n(8); A271990: g_n(9); A266202: g_n(n); A266203: a(n)=k such that g_k(n)=0;

g[k_, n_] := If[k == 0, n, Total@ Flatten@ MapIndexed[#1 (k + 2)^(#2 - 1) &, Reverse@ IntegerDigits[#, k + 1]] &@ g[k - 1, n] - 1]; Table[g[n, 10], {n, 0, 40}]

A271992 g_n(16) where g is the weak Goodstein function defined in A266202.

Original entry on oeis.org

16, 80, 169, 310, 515, 795, 1163, 1631, 2211, 2915, 3755, 4742, 5889, 7208, 8711, 10410, 12317, 14444, 16803, 19406, 22265, 25392, 28799, 32472, 36447, 40736, 45351, 50304, 55607, 61272, 67311, 73736, 80559, 87792, 95447, 103536, 112071

Offset: 0

Natan Arie Consigli, May 24 2016

For more information see A266201 and A266202.

Cf. A271557: G_n(10).

Weak Goodstein sequences: A267647: g_n(4); A267648: g_n(5); A271987: g_n(6); A271988: g_n(7); A271989: g_n(8); A271990: g_n(9); A271991: g_n(10); A137411: g_n(11); A265034: g_n(266); A266202: g_n(n); A266203: a(n)=k such that g_k(n)=0.

g[k_, n_] :=
If[k == 0, n,
  Total@Flatten@
       MapIndexed[#1 (k + 2)^(#2 - 1) &,
        Reverse@IntegerDigits[#, k + 1]] &@g[k - 1, n] - 1]; Table[
g[n, 16], {n, 0, 36}]

cp's OEIS Frontend

A137411 Weak Goodstein sequence starting at 11.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A056041 Value for which b(a(n))=0 when b(2)=n and b(k+1) is calculated by writing b(k) in base k, reading this as being written in base k+1 and then subtracting 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A271991 g_n(10) where g is the weak Goodstein function defined in A266202.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A271992 g_n(16) where g is the weak Goodstein function defined in A266202.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica