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