TOPICS
Search

Ulam Sequence


A Ulam sequence with initial positive integers u<v is the increasing sequence {a_n} defined by a_1=u and a_2=v. For n>2, a_n is the least integer greater than a_(n-1) having exactly one representation as the sum a_i+a_j with 1<=i<j<n. The numbers so produced are sometimes called u-numbers or Ulam numbers.

The first few numbers in the (1, 2)-Ulam sequence are 1, 2, 3, 4, 6, 8, 11, 13, 16, ... (OEIS A002858). Here, the first term after the initial (1, 2) is 3 since 3=1+2. The next term is 4=1+3. The representation 4=2+2 is excluded because its summands are not distinct. 5 is not a member of the sequence since it is representable in two ways, 5=1+4=2+3, but 6=2+4 is a member.

Proceeding in this manner, we can generate Ulam sequences for other initial ordered pairs (u,v), examples of which are given in the table below.

(u,v)Sloanesequence
(1, 2)A0028581, 2, 3, 4, 6, 8, 11, 13, 16, 18, ...
(1, 3)A0028591, 3, 4, 5, 6, 8, 10, 12, 17, 21, ...
(1, 4)A0036661, 4, 5, 6, 7, 8, 10, 16, 18, 19, ...
(1, 5)A0036671, 5, 6, 7, 8, 9, 10, 12, 20, 22, ...
(2, 3)A0018572, 3, 5, 7, 8, 9, 13, 14, 18, 19, ...
(2, 4)A0489512, 4, 6, 8, 12, 16, 22, 26, 32, 36, ...
(2, 5)A0073002, 5, 7, 9, 11, 12, 13, 15, 19, 23, ...

Schmerl and Spiegel (1994) proved that Ulam sequences (2,v) for odd v>=5 have exactly two even terms. Ulam sequences with only finitely many even terms eventually must have periodic successive differences (Finch 1991, 1992abc). Cassaigne and Finch (1995) proved that the Ulam sequences (4,v) for 5<=v=1 (mod 4) have exactly three even terms.

The Ulam sequence can be generalized by the s-additive sequence.


See also

Greedy Algorithm, s-Additive Sequence, Stöhr Sequence

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

Cassaigne, J. and Finch, S. "A Class of 1-Additive Sequences and Quadratic Recurrences." Exper. Math. 4, 49-60, 1995. https://doi.org/10.1080/10586458.1995.10504307.Finch, S. "Conjectures About 1-Additive Sequences." Fib. Quart. 29, 209-214, 1991.Finch, S. "Are 0-Additive Sequences Always Regular?" Amer. Math. Monthly 99, 671-673, 1992a.Finch, S. "On the Regularity of Certain 1-Additive Sequences." J. Combin. Th. Ser. A 60, 123-130, 1992b.Finch, S. "Patterns in 1-Additive Sequences." Exper. Math. 1, 57-63, 1992c.Finch, S. R. "Stolarsky-Harborth Constant." §2.16 in Mathematical Constants. Cambridge, England: Cambridge University Press, pp. 145-151, 2003.Guy, R. K. "A Quarter Century of Monthly Unsolved Problems, 1969-1993." Amer. Math. Monthly 100, 945-949, 1993.Guy, R. K. "Ulam Numbers." §C4 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 109-110, 1994.Guy, R. K. and Nowakowski, R. J. "Monthly Unsolved Problems, 1969-1995." Amer. Math. Monthly 102, 921-926, 1995.Recaman, B. "Questions on a Sequence of Ulam." Amer. Math. Monthly 80, 919-920, 1973.Schmerl, J. and Spiegel, E. "The Regularity of Some 1-Additive Sequences." J. Combin. Theory Ser. A 66, 172-175, 1994.Sloane, N. J. A. Sequences A001857/M0634, A002858/M0557, A002859/M2303, A003666/M3237, A003667/M3746, A007300/M1328, and A048951 in "The On-Line Encyclopedia of Integer Sequences."Wolfram, S. A New Kind of Science. Champaign, IL: Wolfram Media, p. 908, 2002.

Referenced on Wolfram|Alpha

Ulam Sequence

Cite this as:

Weisstein, Eric W. "Ulam Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/UlamSequence.html

Subject classifications