Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jul 12 2015 15:43:33
%S 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 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 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 a(n) = 2*sum(k=1,n, A076213(k)) - n.
%F 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 Cf. A005132.
%K nonn
%O 1,2
%A _Benoit Cloitre_, Nov 05 2002