|
Search: id:A059936
|
|
|
| A059936 |
|
Fifth step in Goodstein sequences, i.e. g(7) if g(2)=n: write g(6)=A059935(n) in hereditary representation base 6, bump to base 7, then subtract 1 to produce g(7). |
|
+0
6
|
|
| 0, 109, 1197, 98039, 823543, 1647195, 2471826, 4215754, 5764801, 5764910, 5765998, 5862840, 6588344, 51037022878648920352086101818782039022705041348954514018604541825139684640232050\ 38690962121196797
(list; graph; listen)
|
|
|
OFFSET
|
3,2
|
|
|
REFERENCES
|
Goodstein, R. L. "On the Restricted Ordinal Theorem." J. Symb. Logic 9, 33-41, 1944
|
|
EXAMPLE
|
a(12) = 5764910 since with g(2) = 12 = 2^(2 + 1) + 2^2, we get g(3) = 3^(3 + 1) + 3^3-1 = 107 = 3^(3 + 1) + 2*3^2 + 2*3 + 2, g(4) = 4^(4 + 1) + 2*4^2 + 2*4 + 1 = 1065, g(5) = 5^(5 + 1) + 2*5^2 + 2*5 = 15685, g(6) = 6^(6 + 1) + 2*6^2 + 6 + 5 = 280019 and g(7) = 7^(7 + 1) + 2*7^2 + 7 + 4 = 5764910.
|
|
CROSSREFS
|
Cf. A056004, A057650, A059933, A059934, A059935.
Sequence in context: A103565 A061699 A096214 this_sequence A061724 A145852 A144930
Adjacent sequences: A059933 A059934 A059935 this_sequence A059937 A059938 A059939
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Feb 12 2001
|
|
|
Search completed in 0.002 seconds
|
