A352752 a(n) is the smallest nonnegative number that requires n applications of the modified Sisyphus function of order 3, x -> A350709(x) to reach any number in the cycle {4031, 4112, 4220}.

4031, 1001, 0, 10, 1000000000

Offset

0,1

Comments

The next term, a(5), is 1 0^100 1^9 2^10, a number with 120 digits, is too large to display.

References

M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141.

Links

Table of n, a(n) for n=0..4.

Example

0 -> 1100 -> 4220 reaches an element of the cycle {4031, 4112, 4220} in two iterates and must be the smallest, so a(2) = 0

Crossrefs

Cf. A350709.

Sequence in context: A247689 A258401 A258883 * A249107 A329881 A234838

Adjacent sequences: A352749 A352750 A352751 * A352753 A352754 A352755

Keyword

nonn,base,more

Author

Matthew E. Coppenbarger, Apr 01 2022

Status

approved