This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A385249 #22 Aug 06 2025 19:32:04
%S A385249 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 A385249 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 A385249 3,3,4,1,2,2,3,2,4,3,2,4,3,2,3,3,2,3,3
%N A385249 Number of iterations of seven segments count x -> A010371(x) to go from n to a fixed point.
%C A385249 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 A385249 This sequence is unbounded and the first occurrence of a(n) = k is at n = A385250(k).
%e A385249 For n = 12, the a(12) = 2 steps are 12 -> 7 -> 4 segments, and 4 is a fixed point A010371(4) = 4.
%Y A385249 Cf. A010371, A385250.
%Y A385249 Cf. A328330 (segments variation).
%K A385249 nonn,base,easy
%O A385249 0,2
%A A385249 _Marco Ripà_, Jul 28 2025