A076258 a(n) = 2*sum(k=1,n, A076213(k)) - n.

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

Links

Table of n, a(n) for n=1..105.

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

Adjacent sequences: A076255 A076256 A076257 * A076259 A076260 A076261

Keyword

nonn

Author

Benoit Cloitre, Nov 05 2002

Status

approved