login

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”).

A349465
The d_i coefficients of the standard form decomposition of U(1,X), the Ulam sequence starting with 1, X in the ordered abelian group of linear integer polynomials in X, where the ordering is lexigraphical.
3
1, 0, 2, 0, -1, 1, 1, 2, 2, 1, 2, 2, 3, 2, 3, 4, 5, 3, 4, 3, 5, 6, 5, 4, 4, 6, 7, 6, 7, 6, 8, 8, 8, 9, 10, 10, 10, 11, 11, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 19, 19, 19, 20, 20, 20, 21, 21, 22, 22, 23, 24, 24, 25, 25, 25, 26, 26, 27, 27, 27, 29, 30, 31, 31, 31, 32, 32, 33, 33
OFFSET
0,3
COMMENTS
The set U(1,X) can be defined as follows: it is the unique set of linear integer polynomials such that 1,X are the two smallest elements; for any interval [P,Q] where P,Q are linear integer polynomials, U(1,X) intersect [P,Q] has a minimum and a maximum; and finally, an element u > X is in U(1,X) if and only if it is the smallest element larger than the maximum of U(1,X) intersect [1,u - 1] and which can be written as a sum of two distinct elements in U(1,X) in exactly one way.
U(1,X) can be written uniquely as a union of intervals [a_i X + b_i, c_i X + d_i], where c_i X + d_i + 1 < a_{i + 1} X + b_{i + 1} for all indices i. Here, we give just the coefficients d_i.
This set is related to Ulam sequences in an odd way. Let U(1,n) be the sequence of integers starting with 1,n such that every subsequent term is the next smallest element that can be written as the sum of two distinct prior terms in exactly one way. Then, for all integers k, for all sufficiently large n, U(1,n) intersect [1,c_k n + d_k + 1] = eval_n(U(1,X) intersect [1,c_k X + d_k + 1]), where eval_n is the evaluation map sending X to n.
It is conjectured that for all k and n > 3, U(1,n) intersect [1,c_k n + d_k + 1] = eval_n(U(1,X) intersect [1,c_k X + d_k + 1]). At the time of writing, this had been checked up to k = 217529.
U(1,X) can also be defined model-theoretically, as follows. Let *Z denote the hyper-integers. The sequence of sets U(1,n) indexed over positive integers has a unique extension to a sequence of sets indexed over positive hyper-integers. Take any positive non-standard integer H, and consider the corresponding set U(1,H) in this sequence. Then the intersection of U(1,H) with the set of integer polynomials in H will be isomorphic to U(1,X).
REFERENCES
J. Hinman, B. Kuca, A. Schlesinger, and A. Sheydvasser, The Unreasonable Rigidity of Ulam Sequences, J. Number Theory, 194 (2019), 409-425.
A. Sheydvasser, The Ulam Sequence of the Integer Polynomial Ring, J. Integer Seq., accepted.
LINKS
J. Hinman, B. Kuca, A. Schlesinger, and A. Sheydvasser, The Unreasonable Rigidity of Ulam Sequences, arXiv:1711.00145 [math.NT], 2017.
EXAMPLE
The first four intervals of U(1,X) are [1,1], [X,2X], [2X + 2, 2X + 2], [4X, 4X] hence the corresponding d_i coefficients are 1,0,2,0.
CROSSREFS
Cf. A349462, A349463, A349464 for the other coefficients. The original Ulam sequence U(1,2) is A002858.
Sequence in context: A051160 A051159 A331545 * A035697 A135549 A262666
KEYWORD
sign
AUTHOR
STATUS
approved