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 A076258 #10 Mar 25 2025 23:58:06
%S A076258 1,2,1,2,3,4,3,4,3,4,3,4,3,4,3,4,5,6,5,6,5,4,5,4,5,4,5,4,5,4,5,6,7,6,
%T A076258 7,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,5,6,7,8,7,8,
%U A076258 7,8,7,8,7,8,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,6,7,8,9,8,9,8,9
%N A076258 a(n) = 2 * Sum_{k=1..n} A076213(k) - n.
%F A076258 It seems that a(n)>0, a(n)/log(n) is bounded and sum(k=1, n, a(k)) is asymptotic to c*n*log(n) 1 < c < 1.5.
%Y A076258 Cf. A005132.
%K A076258 nonn
%O A076258 1,2
%A A076258 _Benoit Cloitre_, Nov 05 2002