The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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: A213088 A169809 A214962 * A259576 A330636 A030330 Adjacent sequences:  A076255 A076256 A076257 * A076259 A076260 A076261 KEYWORD nonn AUTHOR Benoit Cloitre, Nov 05 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 21:46 EST 2022. Contains 350472 sequences. (Running on oeis4.)