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

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

Offset

0,2

Comments

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

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

Links

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

Wikipedia, Seven-segment display.

Example

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

Crossrefs

Cf. A277116, A328330, A385249, A386910, A387106.

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

Sequence in context: A388712 A025901 A204431 * A361509 A143809 A385240

Adjacent sequences: A386241 A386242 A386243 * A386245 A386246 A386247

Keyword

nonn,easy,base

Author

Marco Ripà, Aug 21 2025

Status

approved