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 A386910 #14 Aug 16 2025 12:57:27
%S A386910 2,2,1,1,0,0,1,2,3,1,4,1,3,3,2,3,3,1,2,3,2,3,5,5,2,5,5,4,4,5,2,3,5,5,
%T A386910 2,5,5,4,4,5,5,2,2,2,4,2,2,3,2,2,2,3,5,5,2,5,5,4,4,5,2,3,5,5,2,5,5,4,
%U A386910 4,5,2,1,4,4,3,4,4,2,5,4,4,2,4,4,2,4,4
%N A386910 Number of iterations of seven segments count x -> A063720(x) to go from n to a fixed point.
%C A386910 A063720 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}.
%C A386910 This sequence is unbounded and the first occurrence of a(n) = k is at n = A338255(k + 1) for any k >= 3.
%e A386910 For n = 12, the a(12) = 3 steps are 12 -> 7 -> 3 -> 5 segments, and 5 is a fixed point A063720(5) = 5.
%Y A386910 Cf. A063720, A328330, A338255, A385249.
%Y A386910 Cf. A006942, A010371, A074458, A277116 (segments variation).
%K A386910 nonn,base,easy
%O A386910 0,1
%A A386910 _Marco Ripà_, Aug 07 2025