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

Author

Matthew E. Coppenbarger, Apr 01 2022

Keywords

• nonn
• base
• more

Comments

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

Examples

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

References

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

Crossrefs

Cf. A350709.