Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059934
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059934 Third step in Goodstein sequences, i.e. g(5) if g(2)=n: write g(4)=A057650(n) in hereditary representation base 4, bump to base 5, then subtract 1 to produce g(5). +0
6
0, 2, 60, 467, 3125, 3127, 6310, 9842, 15625, 15627, 15685, 16092, 18750, 18752, 53793641718868912174424175024032593379100060 (list; graph; listen)
OFFSET

2,2

REFERENCES

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

EXAMPLE

a(12) = 15685 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 + 2-1 = 1065 and g(5) = 5^(5 + 1) + 2*5^2 + 2*5^1 + 1-1.

CROSSREFS

Cf. A056004, A057650, A059933, A059935, A059936.

Sequence in context: A141055 A048541 A067739 this_sequence A006333 A001760 A157059

Adjacent sequences: A059931 A059932 A059933 this_sequence A059935 A059936 A059937

KEYWORD

hard,nonn

AUTHOR

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

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