login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056004 Initial step in Goodstein sequences, i.e. g(3) if g(2)=n: write n in hereditary representation base 2, bump to base 3, then subtract 1. 11
0, 2, 3, 26, 27, 29, 30, 80, 81, 83, 84, 107, 108, 110, 111, 7625597484986, 7625597484987, 7625597484989, 7625597484990, 7625597485013, 7625597485014, 7625597485016, 7625597485017, 7625597485067, 7625597485068, 7625597485070 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

_Reinhard Zumkeller_, Table of n, a(n) for n = 1..10000

Eric Weisstein's World of Mathematics, Heriditary Representation.

Eric Weisstein's World of Mathematics, Goodstein Sequence.

Wikipedia, Goodstein's Theorem

_Reinhard Zumkeller_, Haskell programs for Goodstein sequences

EXAMPLE

a(18)=7625597484989 since 18=2^(2^2)+2^1 which when bumped from 2 to 3 becomes 3^(3^3)+3^1=76255974849890 and when 1 is subtracted gives 7625597484989

PROG

(Haskell)  see Link

CROSSREFS

See A222112 for a comparable definition.

Sequence in context: A060371 A130975 A002748 * A032812 A099006 A041659

Adjacent sequences:  A056001 A056002 A056003 * A056005 A056006 A056007

KEYWORD

nonn

AUTHOR

Henry Bottomley, Aug 04 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 18 02:14 EDT 2013. Contains 226327 sequences.