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 M0689 N0254 #37 Jun 26 2017 22:58:43
%S 1,2,3,5,8,13,17,26,34,45,54,67,81,97,115,132,153,171,198,228,256,288,
%T 323,357,400,439,488,530,581,627,681,732,790,843,908,963,1029,1085,
%U 1152,1213,1284,1346,1418,1484,1561,1630,1710,1785,1867,1945,2034,2116
%N A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Manfred Scheucher, <a href="/A001149/b001149.txt">Table of n, a(n) for n = 1..2000</a>
%H R. K. Guy, <a href="http://www.jstor.org/stable/2691503">The Second Strong Law of Small Numbers</a>, Math. Mag, 63 (1990), no. 1, 3-20.
%H R. K. Guy, <a href="/A005347/a005347.pdf">The Second Strong Law of Small Numbers</a>, Math. Mag, 63 (1990), no. 1, 3-20. [Annotated scanned copy]
%H R. K. Guy and N. J. A. Sloane, <a href="/A005180/a005180.pdf">Correspondence</a>, 1988.
%H N. J. A. Sloane, <a href="/A001149/a001149.pdf">Handwritten notes on Self-Generating Sequences, 1970</a> (note that A1148 has now become A005282)
%H Manfred Scheucher, <a href="/A001149/a001149_1.py.txt">Python Script</a>
%Y Cf. A005282, A054540.
%K nonn
%O 1,2
%A _N. J. A. Sloane_
%E Description corrected and moved to name line by _Franklin T. Adams-Watters_, Nov 01 2009
%E More terms from _Manfred Scheucher_, Jul 01 2015