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 A387106 #9 Aug 21 2025 00:14:32
%S A387106 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,
%T A387106 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,
%U A387106 3,2,4,1,2,2,3,2,4,3,2,2,3,2,3,3,2,3,3
%N A387106 Number of iterations of seven segments count x -> A074458(x) to go from n to a fixed point.
%C A387106 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}.
%C A387106 This sequence is unbounded and the first occurrence of a(n) = k is at n = A338255(k + 2) for any k >= 3.
%H A387106 Wikipedia, <a href="https://en.wikipedia.org/wiki/Seven-segment_display">Seven-segment display</a>.
%e A387106 For n = 10, the a(10) = 3 steps are 10 -> 8 -> 7 -> 4 segments, and 4 is a fixed point A074458(4) = 4.
%Y A387106 Cf. A074458, A328330, A385249, A386910.
%Y A387106 Cf. A006942, A010371, A063720, A277116 (segments variation).
%K A387106 nonn,base,easy
%O A387106 0,2
%A A387106 _Marco Ripà_, Aug 16 2025