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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064067 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)=2. 3
1, 2, 3, 4, 5, 5, 6, 7, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 11, 8, 9, 10, 11, 12, 12, 13, 7, 8, 9, 10, 11, 11, 12, 13, 8, 9, 10, 11, 12, 12, 13, 14, 13, 9, 10, 11, 12, 13, 13, 14, 15, 14, 15, 10, 11, 12, 13, 14, 14, 15, 16, 15, 16, 17, 7, 8, 9, 10, 11, 11, 12, 13, 12, 13, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..78.

EXAMPLE

Start with (1,2). So after initial step have (1, *2*, 1+2 = 3), then (1, 2, *3*, 1+3 = 4, 2+3 = 5), then (1, 2, 3, *4*, 5, 1+4 = 5, 2+4 = 6, 3+4 = 7), then (1, 2, 3, 4, *5*, 5, 6, 7, 1+5 = 6, 2+5 = 7, 3+5 = 8, 4+5 = 9), etc.

CROSSREFS

Each positive number appears A063895 number of times.

Cf. A064064, A064065, A064066.

Sequence in context: A005375 A138370 A125051 * A202306 A275579 A198292

Adjacent sequences:  A064064 A064065 A064066 * A064068 A064069 A064070

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 04:26 EST 2020. Contains 332197 sequences. (Running on oeis4.)