|
%I M2303 N0909 #44 Dec 22 2021 00:07:54
%S 1,3,4,5,6,8,10,12,17,21,23,28,32,34,39,43,48,52,54,59,63,68,72,74,79,
%T 83,98,99,101,110,114,121,125,132,136,139,143,145,152,161,165,172,176,
%U 187,192,196,201,205,212,216,223,227,232,234,236,243,247,252,256,258
%N a(1) = 1, a(2) = 3; for n >= 3, a(n) is smallest number that is uniquely of the form a(j) + a(k) with 1 <= j < k < n.
%C An Ulam-type sequence - see A002858 for many further references, comments, etc.
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.
%D R. K. Guy, Unsolved Problems in Number Theory, Section C4.
%D R. K. Guy, "s-Additive sequences," preprint, 1994.
%D C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 358.
%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).
%D S. M. Ulam, Problems in Modern Mathematics, Wiley, NY, 1960, p. ix.
%H T. D. Noe, <a href="/A002859/b002859.txt">Table of n, a(n) for n = 1..10000</a>
%H Steven R. Finch, <a href="/FinchSadd.html">Ulam s-Additive Sequences</a> [From Steven Finch, Apr 20 2019]
%H Raymond Queneau, <a href="https://doi.org/10.1016/0097-3165(72)90083-0">Sur les suites s-additives</a>, J. Combin. Theory A 12(1) (1972), 31-71.
%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 S. M. Ulam, <a href="/A002858/a002858.pdf">On some mathematical problems connected with patterns of growth of figures</a>, pp. 215-224 of R. E. Bellman, ed., Mathematical Problems in the Biological Sciences, Proc. Sympos. Applied Math., Vol. 14, Amer. Math. Soc., 1962. [Annotated scanned copy]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/UlamSequence.html">Ulam Sequence</a>.
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Ulam_number">Ulam number</a>.
%H <a href="/index/U#Ulam_num">Index entries for Ulam numbers</a>.
%e 7 is missing since 7 = 1 + 6 = 3 + 4; but 8 is present since 8 = 3 + 5 has a unique representation.
%t s = {1, 3}; Do[ AppendTo[s, n = Last[s]; While[n++; Length[ DeleteCases[ Intersection[s, n-s], n/2, 1, 1]] != 2]; n], {60}]; s (* _Jean-François Alcover_, Oct 20 2011 *)
%o (Haskell)
%o a002859 n = a002859_list !! (n-1)
%o a002859_list = 1 : 3 : ulam 2 3 a002859_list
%o -- Function ulam as defined in A002858.
%o -- _Reinhard Zumkeller_, Nov 03 2011
%Y Cf. A002858 (version beginning 1,2), A199118, A199119.
%K nonn,nice
%O 1,2
%A _N. J. A. Sloane_, _Mira Bernstein_
|
