A387106 Number of iterations of seven segments count x -> A074458(x) to go from n to a fixed point.

1, 2, 1, 1, 0, 0, 0, 1, 2, 1, 3, 1, 2, 2, 1, 2, 3, 1, 2, 2, 2, 2, 4, 4, 2, 4, 2, 2, 3, 4, 2, 2, 4, 4, 2, 4, 2, 2, 3, 4, 4, 1, 2, 2, 3, 2, 4, 3, 2, 2, 2, 2, 4, 4, 2, 4, 2, 2, 3, 4, 3, 3, 2, 2, 4, 2, 3, 4, 3, 2, 4, 1, 2, 2, 3, 2, 4, 3, 2, 2, 3, 2, 3, 3, 2, 3, 3

Offset: 0

Author

Marco Ripà, Aug 16 2025

Keywords

• nonn
• base
• easy

Comments

A074458 is a strictly decreasing function A063720(x) < x whenever x >= 10 and all single digit x reach a fixed point A063720(x) = x with x in {4, 5}.

This sequence is unbounded and the first occurrence of a(n) = k is at n = A338255(k + 2) for any k >= 3.

Examples

			For n = 10, the a(10) = 3 steps are 10 -> 8 -> 7 -> 4 segments, and 4 is a fixed point A074458(4) = 4.
		

Links

• Wikipedia, Seven-segment display.

Crossrefs

Cf. A074458, A328330, A385249, A386910.

Cf. A006942, A010371, A063720, A277116 (segments variation).