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 #9 Oct 19 2018 04:56:18
%S 2,3,7,12,18,26,35,45,56,69,83,98,114,131,150,170,191,213,236,260,285,
%T 312,340,369,399,430,462,495,529,565,602,640,679,719,760,802,845,889,
%U 935,982,1030,1079,1129,1180,1232,1285,1339,1394,1451,1509,1568,1628
%N Sequence and first differences (A061578) include all numbers.
%C The lexicographically earliest sequence that begins with 2 and together with its first differences (A030124) contain every positive integer exactly once.
%C a(n) = A022953(n-1) for 2 < n <= 10000. - _Georg Fischer_, Oct 19 2018
%H Ivan Neretin, <a href="/A061577/b061577.txt">Table of n, a(n) for n = 1..10000</a>
%t Fold[Append[#1, #1[[#2]] + Complement[Range[Max@#1 + 1], #1][[#2]]] &, {2}, Range[50]] (* _Ivan Neretin_, Apr 04 2016 *)
%Y Cf. A005228, A022953, A061578.
%K nonn,easy
%O 1,1
%A Ronald van Eijck (eequalsmcsquare(AT)hotmail.com), May 21 2001
%E More terms from Larry Reeves (larryr(AT)acm.org), Jun 12 2001