Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059933 Goodstein sequence with a(2)=16: to calculate a(n+1), write a(n) in the hereditary representation base n, then bump the base to n+1, then subtract 1. +0
8
16, 7625597484986, 50973998591214355139406377, 19916489515870532960258562190639398471599239042185934648024761145811, 51037022878648920352086101818782039022705041348954514018604541825139684640232050\ 38690962121196797 (list; graph; listen)
OFFSET

2,1

COMMENT

Goodstein's theorem shows that such a sequence is finite (i.e. it eventually stablizes and then decreases by 1 in each step until it reaches 0) for any starting point of a(2). In this case of a(2)=16, there seems little possibility of describing how incredibly large n must be for a(n)=0.

REFERENCES

Goodstein, R. L. "On the Restricted Ordinal Theorem." J. Symb. Logic 9, 33-41, 1944

EXAMPLE

a(2) = 16 = 2^(2^2) so a(3) = 3^(3^3)-1 = 7625597484986.

So a(3) = 2*3^(2*3^2 + 2*3 + 2) + 2*3^(2*3^2 + 2*3 + 1) + 2*3^(2*3^2 + 2*3) + 2*3^(2*3^2 + 1*3 + 2) + 2*3^(2*3^2 + 1*3 + 1) + 2*3^(2*3^2 + 1*3) + 2*3^(2*3^2 + 2) + 2*3^(2*3^2 + 1) + 2*3^(2*3^2) + 2*3^(3^2 + 2*3 + 2) + 2*3^(3^2 + 2*3 + 1) + 2*3^(3^2 + 2*3) + 2*3^(3^2 + 1*3 + 2) + 2*3^(3^2 + 1*3 + 1) + 2*3^(3^2 + 1*3) + 2*3^(3^2 + 2) + 2*3^(3^2 + 1) + 2*3^(3^2) + 2*3^(2*3 + 2) + 2*3^(2*3 + 1) + 2*3^(2*3) + 2*3^(1*3 + 2) + 2*3^(1*3 + 1) + 2*3^(1*3) + 2*3^(2) + 2*3^(1) + 2,

leading to a(4) = 2*4^(2*4^2 + 2*4 + 2) + 2*4^(2*4^2 + 2*4 + 1) + 2*4^(2*4^2 + 2*4) + 2*4^(2*4^2 + 1*4 + 2) + 2*4^(2*4^2 + 1*4 + 1) + 2*4^(2*4^2 + 1*4) + 2*4^(2*4^2 + 2) + 2*4^(2*4^2 + 1) + 2*4^(2*4^2) + 2*4^(4^2 + 2*4 + 2) + 2*4^(4^2 + 2*4 + 1) + 2*4^(4^2 + 2*4) + 2*4^(4^2 + 1*4 + 2) + 2*4^(4^2 + 1*4 + 1) + 2*4^(4^2 + 1*4) + 2*4^(4^2 + 2) + 2*4^(4^2 + 1) + 2*4^(4^2) + 2*4^(2*4 + 2) + 2*4^(2*4 + 1) + 2*4^(2*4) + 2*4^(1*4 + 2) + 2*4^(1*4 + 1) + 2*4^(1*4) + 2*4^(2) + 2*4^(1) + 1 = 2*(4^32 + 4^16 + 1)*(4^8 + 4^4 + 1)*(4^2 + 4*1)-1 = 50973998591214355139406377.

CROSSREFS

Cf. A056193, A056004, A057650, A056041.

Sequence in context: A116102 A013878 A058418 this_sequence A002488 A144692 A088469

Adjacent sequences: A059930 A059931 A059932 this_sequence A059934 A059935 A059936

KEYWORD

fini,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Feb 12 2001

EXTENSIONS

Definition corrected by N. J. A. Sloane (njas(AT)research.att.com), Mar 06 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research