|
|
A308002
|
|
a(n) = smallest nonnegative number that requires n applications of the modified Sisyphus function x -> A171797(x) to reach 312.
|
|
6
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The next term, a(5), is 1 0^1000099 1^100010, a number with 1100110 digits, and is too large to display here.
a(n) = index of first n in A100961.
|
|
REFERENCES
|
M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141.
|
|
LINKS
|
|
|
EXAMPLE
|
0 -> 110 -> 312 reaches 312 in two steps, so a(2) = 0.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|