A001149 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

1, 2, 3, 5, 8, 13, 17, 26, 34, 45, 54, 67, 81, 97, 115, 132, 153, 171, 198, 228, 256, 288, 323, 357, 400, 439, 488, 530, 581, 627, 681, 732, 790, 843, 908, 963, 1029, 1085, 1152, 1213, 1284, 1346, 1418, 1484, 1561, 1630, 1710, 1785, 1867, 1945, 2034, 2116

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn

References

• N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• Manfred Scheucher, Table of n, a(n) for n = 1..2000
• R. K. Guy, The Second Strong Law of Small Numbers, Math. Mag, 63 (1990), no. 1, 3-20.
• R. K. Guy, The Second Strong Law of Small Numbers, Math. Mag, 63 (1990), no. 1, 3-20. [Annotated scanned copy]
• R. K. Guy and N. J. A. Sloane, Correspondence, 1988.
• N. J. A. Sloane, Handwritten notes on Self-Generating Sequences, 1970 (note that A1148 has now become A005282)
• Manfred Scheucher, Python Script

Crossrefs

Cf. A005282, A054540.

Extensions

Description corrected and moved to name line by Franklin T. Adams-Watters, Nov 01 2009

More terms from Manfred Scheucher, Jul 01 2015