login
A076258
a(n) = 2*sum(k=1,n, A076213(k)) - n.
0
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, 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, 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
OFFSET
1,2
FORMULA
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.
CROSSREFS
Cf. A005132.
Sequence in context: A350809 A366525 A360737 * A259576 A330636 A030330
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 05 2002
STATUS
approved