|
|
A056004
|
|
Initial step in Goodstein sequences: write n in hereditary representation base 2, bump to base 3, then subtract 1.
|
|
22
|
|
|
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
|
|
COMMENTS
|
To write an integer n in base-k hereditary representation, write n in ordinary base-k representation, and then do the same recursively for all exponents which are greater than k: e.g., 2^18 = 2^(2^4 + 2) = 2^(2^(2^2) + 2). "Bump to base 3" means to replace all the 2's in that representation by 3. - M. F. Hasler, Feb 19 2017
|
|
LINKS
|
|
|
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 an alternate version.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|