|
%I M0634 N0231 #46 Dec 22 2021 00:09:50
%S 2,3,5,7,8,9,13,14,18,19,24,25,29,30,35,36,40,41,46,51,56,63,68,72,73,
%T 78,79,83,84,89,94,115,117,126,153,160,165,169,170,175,176,181,186,
%U 191,212,214,230,235,240,245,266,273,278,283,288,325,331,332,337,342
%N a(1)=2, 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.
%C A plot of the first 10^6 terms shows a nearly straight line having a slope of about 11.1. In contrast to A002858, this sequence has many consecutive numbers; of the first 10^6 terms, consecutive numbers appear 141674 times! - _T. D. Noe_, Jan 21 2008
%D S. R. Finch, Patterns in 1-additive sequences, Experimental Mathematics 1 (1992), 57-63.
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 145-151.
%D R. K. Guy, Unsolved Problems in Number Theory, Section C4.
%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="/A001857/b001857.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 J. Cassaigne and S. R. Finch, <a href="http://www.emis.de/journals/EM/expmath/volumes/4/4.html">A class of 1-additive sequences and additive recurrences</a>
%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 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>
%t s = {2, 3}; Do[ AppendTo[s, n = Last[s]; While[n++; Length[ DeleteCases[ Intersection[s, n-s], n/2, 1, 1]] != 2]; n], {100}]; s (* _Jean-François Alcover_, Sep 08 2011 *)
%o (Haskell)
%o a001857 n = a001857_list !! (n-1)
%o a001857_list = 2 : 3 : ulam 2 3 a001857_list
%o -- Function ulam as defined in A002858.
%o -- _Reinhard Zumkeller_, Nov 03 2011
%Y Cf. A100729.
%Y Cf. A199122, A199123.
%K nonn,nice
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Jud McCranie_
|
