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 A374999 #5 Jul 28 2024 17:01:45
%S A374999 1,2,1,3,2,2,1,4,2,1,1,3,2,2,1,5,2,3,1,3,2,2,1,4,2,1,1,3,1,2,1,6,2,3,
%T A374999 1,1,3,3,1,4,3,1,2,3,2,2,1,5,2,3,1,3,2,2,1,4,1,2,1,3,1,2,1,7,2,3,1,4,
%U A374999 3,3,1,4,2,1,1,2,2,3,1,5,3,2,1,3,2,1,1
%N A374999 Position of the last requested element when the elements of the n-th composition (in standard order) are requested from a self-organizing list initialized to (1, 2, 3, ...), using the frequency-count updating strategy.
%C A374999 See A374994 for details.
%F A374999 a(n) = A374994(n) - A374994(A025480(n-1)).
%F A374999 Sum_{j=1..m} a(n*2^j+2^(j-1)) = m*(m+1)/2 if m >= A333766(n). This is a consequence of the fact that the first m positions of the list are occupied by the elements 1, ..., m, as long as no element larger than m has been requested so far.
%Y A374999 Analogous sequences for other updating strategies: A374997, A374998, A375000.
%Y A374999 Cf. A025480, A066099 (compositions in standard order), A333766, A374994.
%K A374999 nonn
%O A374999 1,2
%A A374999 _Pontus von Brömssen_, Jul 27 2024