A385249 - OEIS

%I #26 Oct 09 2025 04:18:14

%S 1,2,1,1,0,0,0,1,2,1,3,1,2,2,1,2,3,1,2,3,2,2,4,4,2,4,2,2,3,2,2,2,4,4,

%T 2,4,2,2,3,2,4,1,2,2,3,2,4,3,2,4,2,2,4,4,2,4,2,2,3,2,3,3,2,2,4,2,3,4,

%U 3,3,4,1,2,2,3,2,4,3,2,4,3,2,3,3,2,3,3

%N Number of iterations of seven segments count x -> A010371(x) to go from n to a fixed point.

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

%C This sequence is unbounded.

%e For n = 12, the a(12) = 2 steps are 12 -> 7 -> 4 segments, and 4 is a fixed point A010371(4) = 4.

%Y Cf. A010371.

%Y Cf. A328330 (segments variation).

%K nonn,base,easy

%O 0,2

%A _Marco Ripà_, Jul 28 2025