Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Aug 03 2017 02:57:02
%S 0,1,1,1,2,1,2,2,2,3,3,3,1,2,2,2,3,2,3,3,3,4,3,2,3,3,3,4,3,4,2,3,3,3,
%T 4,3,4,4,3,4,4,4,5,4,5,5,5,3,4,4,4,5,4,5,5,5,6,3,4,4,4,5,4,5,5,5,6,6,
%U 1,2,2,2,3,2,3,3,3,4,4,4,2,3,3,3,4,3,4,4,4,5,5,5,3,2,3,3,3,4,3,4,4,4,5,5,5
%N 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)=0, a(1)=1.
%C Each positive number appears an infinite number of times: e.g., a(k)=1 whenever k-1 is in A006894.
%e Start with (0,1). So after initial step have (0, *1*, 0+1 = 1), then (0, 1, *1*, 0+1 = 1, 1+1 = 2), then (0, 1, 1, *1*, 2, 0+1 = 1, 1+1 = 2, 1+1 = 2), then (0, 1, 1, 1, *2*, 1, 2, 2, 0+2 = 2, 1+2 = 3, 1+2 = 3, 1+2 = 3), etc.
%Y Cf. A064064, A064066, A064067.
%K nonn
%O 0,5
%A _Henry Bottomley_, Aug 31 2001