A271560 a(n) = G_n(13), where G is the Goodstein function defined in A266201.
13, 108, 1279, 16092, 280711, 5765998, 134219479, 3486786855, 100000003325, 3138428381103, 106993205384715, 3937376385706415, 155568095557821073, 6568408355712901455, 295147905179352838943, 14063084452067725006646, 708235345355337676376131, 37589973457545958193377292
Offset: 0
Examples
G_1(13) = B_2(13)-1 = B_2(2^(2+1)+2^2+1)-1 = 3^(3+1)+3^3+1-1 = 108; G_2(13) = B_3(3^(3+1)+3^3)-1 = 4^(4+1)+4^4-1 = 1279; G_3(13) = B_4(4^(4+1)+3*4^3+3*4^2+3*4+3)-1 = 5^(5+1)+3*5^3+3*5^2+3*5+3-1 = 16092; G_4(13) = B_5(5^(5+1)+3*5^3+3*5^2+3*5+2)-1 = 6^(6+1)+3*6^3+3*6^2+3*6+2-1 = 280711; G_5(13) = B_6(6^(6+1)+3*6^3+3*6^2+3*6+1)-1 = 7^(7+1)+3*7^3+3*7^2+3*7+1-1 = 5765998; G_6(13) = B_7(7^(7+1)+3*7^3+3*7^2+3*7)-1 = 8^(8+1)+3*8^3+3*8^2+3*8-1 = 134219479; G_7(13) = B_8(8^(8+1)+3*8^3+3*8^2+2*8+7)-1 = 9^(9+1)+3*9^3+3*9^2+2*9+7-1 = 3486786855.
Links
- Nicholas Matteo, Table of n, a(n) for n = 0..383
Crossrefs
Programs
-
PARI
lista(nn) = {my(a=13); print1(a, ", "); for (n=2, nn, my(pd = Pol(digits(a, n)), q = sum(k=0, poldegree(pd), my(c=polcoeff(pd, k)); if (c, c*x^subst(Pol(digits(k, n)), x, n+1), 0))); a = subst(q, x, n+1) - 1; print1(a, ", "); ); }