proposed
approved
proposed
approved
editing
proposed
Michael De Vlieger, <a href="/A118028/b118028.txt">Table of n, a(n) for n = 0..1000</a>
a = {1}; Do[k = 2; While[Nand[FreeQ[a, k], k >= i], k++]; AppendTo[a, a[[i]] + k], {i, 53}]; a (* Michael De Vlieger, Sep 19 2017 *)
approved
editing
Leroy Quet , Apr 10 2006
_Leroy Quet _ Apr 10 2006
More terms from _Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), _, Jul 27 2006
Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)
easy,nonn,new
Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)
easy,nonn,new
Leroy Quet (qq-quet(AT)mindspring.com), Apr 10 2006
a(0)=1. a(n) = a(n-1) + (lowest smallest integer which is >= n and is missing from the earlier terms of the sequence).
easy,nonn,new