The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064066 n-th step is to add a(n) to each previous number a(k) (excluding itself, i.e., k < n) to produce n more terms of the sequence, starting with a(0)=1, a(1)=1. 3
 1, 1, 2, 3, 3, 4, 4, 5, 4, 4, 5, 6, 5, 5, 6, 7, 7, 5, 5, 6, 7, 7, 8, 6, 6, 7, 8, 8, 9, 9, 5, 5, 6, 7, 7, 8, 8, 9, 5, 5, 6, 7, 7, 8, 8, 9, 8, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 7, 7, 8, 9, 9, 10, 10, 11, 10, 10, 11, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 10, 11, 6, 6, 7, 8, 8, 9, 9, 10, 9, 9, 10, 11, 10, 7, 7, 8, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS EXAMPLE Start with (1,1). So after initial step have (1, *1*, 1+1 = 2), then (1, 1, *2*, 1+2 = 3, 1+2 = 3), then (1, 1, 2, *3*, 3, 1+3 = 4, 1+3 = 4, 2+3 = 5), then (1, 1, 2, 3, *3*, 4, 4, 5, 1+3 = 4, 1+3 = 4, 2+3 = 5, 3+3 = 6), etc. CROSSREFS Each positive number appears A063894 number of times. Cf. A064064, A064065, A064067. Sequence in context: A030396 A317658 A277615 * A297025 A325134 A218007 Adjacent sequences:  A064063 A064064 A064065 * A064067 A064068 A064069 KEYWORD nonn AUTHOR Henry Bottomley, Aug 31 2001 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 February 17 12:14 EST 2020. Contains 331996 sequences. (Running on oeis4.)