Ulam number¶

Generate a seed-dependent increasing integer sequence by repeatedly choosing the least larger integer having exactly one representation as a sum of two distinct earlier terms.

Version: v1 · 2026-08-30 · History
Domain-specific #: 3019
Origin domain: mathematics
Subdomain: additive number theory

Core Idea¶

For seeds u<v, an Ulam sequence repeatedly adjoins the least integer larger than the current maximum that has exactly one representation as a sum of two distinct earlier sequence terms.^[1] A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of additive number theory and integer sequences. It is the conjunction of greedy minimality, distinct-summand use, exact uniqueness, and dependence on the evolving admitted set. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if one admits every representable sum, permits repeated use of one term, ignores uniqueness, or abandons least-next selection. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: each post-seed term is the least larger integer with representation count exactly one among unordered pairs of distinct earlier terms. The evidential layer asks what observation or proof warrants the claim: enumerate pair sums from the admitted prefix, count distinct representations, and verify minimality above the last term. The use layer asks what reasoning becomes available once the identity is established: studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation. Conflating the layers is the most common source of scope inflation.

Structural Signature¶

Carrier: an increasing sequence of integers beginning from declared seeds
Inputs or antecedent state: two initial integers and the set of all already admitted terms
Constitutive operation: A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate.
Invariant: admission is controlled by exact one-representation status relative to the whole earlier prefix
Recognition test: enumerate pair sums from the admitted prefix, count distinct representations, and verify minimality above the last term
Output or consequence: studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation
Failure boundary: one admits every representable sum, permits repeated use of one term, ignores uniqueness, or abandons least-next selection

What It Is Not¶

It is not the whole field of additive number theory and integer sequences. The field contains many questions and methods that do not instantiate Ulam number.
It is not its most familiar example. The standard Ulam sequence begins 1, 2, 3, 4, 6, 8, 11, 13. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Natural Number. Natural numbers supply the integer carrier; membership in an Ulam sequence is an additional history-dependent predicate.
It is not a claim that every boundary case has one uncontested classification. Published conventions must state positivity, seed order, distinctness of summands, and tie handling; changing them defines another recurrence.
It is not an unrestricted metaphor for any process that seems similar. Outside additive number theory and integer sequences, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Ulam number belongs to additive number theory and integer sequences and is useful where the analyst can specify an increasing sequence of integers beginning from declared seeds, then evaluate admission is controlled by exact one-representation status relative to the whole earlier prefix. The scope is broad within that domain but bounded by the need for each post-seed term is the least larger integer with representation count exactly one among unordered pairs of distinct earlier terms. Computational patterns and empirical densities should not be promoted to theorems without proof.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how two initial integers and the set of all already admitted terms are converted, constrained, or organized by A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate..
Comparison. Compare instances using seed pair, prefix, representation-count profile, gap sequence, density estimates, and eventual regularity, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where Published conventions must state positivity, seed order, distinctness of summands, and tie handling; changing them defines another recurrence. and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making admission is controlled by exact one-representation status relative to the whole earlier prefix the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because Ulam's name also occurs in the unrelated Ulam spiral and Ulam–Harris tree. The disciplined statement is: given two initial integers and the set of all already admitted terms, the structure counts as Ulam number exactly when each post-seed term is the least larger integer with representation count exactly one among unordered pairs of distinct earlier terms.

This format also separates identity from measurement. A computed prefix is exact for its range but cannot alone establish an asymptotic density or eventual law. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: quadratically many pair sums in a naive implementation, dynamically changing uniqueness, long gaps, seed dependence, and sparse asymptotic evidence. Ulam number compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide initial seeds, integer domain, distinctness conventions, and computational cutoffs. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: an increasing sequence of integers beginning from declared seeds. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express each post-seed term is the least larger integer with representation count exactly one among unordered pairs of distinct earlier terms independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From admission is controlled by exact one-representation status relative to the whole earlier prefix, infer studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine Published conventions must state positivity, seed order, distinctness of summands, and tie handling; changing them defines another recurrence. and the Fibonacci sequence is recurrent but uses a fixed local formula rather than greedy unique representation among all earlier terms. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use seed pair, prefix, representation-count profile, gap sequence, density estimates, and eventual regularity to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of additive number theory and integer sequences because they reuse an increasing sequence of integers beginning from declared seeds, A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate., and enumerate pair sums from the admitted prefix, count distinct representations, and verify minimality above the last term. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from The standard Ulam sequence begins 1, 2, 3, 4, 6, 8, 11, 13. to Generalized Ulam sequences U(u,v) vary the initial pair and can display eventual structured differences or other regularities..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—a greedy recurrence whose eligibility predicate depends on the complete generated history—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

The standard Ulam sequence begins 1, 2, 3, 4, 6, 8, 11, 13. Five is excluded because it is both 1+4 and 2+3, whereas six is admitted through the unique pair 2+4 at that stage. This example is canonical because every role can be inspected: the carrier is an increasing sequence of integers beginning from declared seeds; the operative rule is A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate.; the invariant is admission is controlled by exact one-representation status relative to the whole earlier prefix; and the result supports studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation.^[1] Changing incidental notation or scale leaves the structure intact, while removing each post-seed term is the least larger integer with representation count exactly one among unordered pairs of distinct earlier terms destroys the classification.

Mapped back: an increasing sequence of integers beginning from declared seeds → A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate. → admission is controlled by exact one-representation status relative to the whole earlier prefix → studying greedy additive recurrence, generalized seed families, regularity, density, and efficient generation

Applied / In Practice¶

Generalized Ulam sequences U(u,v) vary the initial pair and can display eventual structured differences or other regularities. The recurrence is unchanged; only the seed-dependent history and resulting representation counts differ. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—enumerate pair sums from the admitted prefix, count distinct representations, and verify minimality above the last term—can be run and because the same failure boundary—one admits every representable sum, permits repeated use of one term, ignores uniqueness, or abandons least-next selection—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is a greedy recurrence whose eligibility predicate depends on the complete generated history. Its identity-bearing terms—integer representation, unordered pair, additive recurrence, sequence density, and seed pair—derive their meaning from additive number theory and integer sequences and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, A greedy recurrence recomputes representation multiplicities among earlier distinct terms and selects the least uniquely representable candidate., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially a greedy recurrence whose eligibility predicate depends on the complete generated history. The domain accent is not decorative: integer representation, unordered pair, additive recurrence, sequence density, and seed pair determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in additive number theory and integer sequences.

The proposed strict upward parent is prime:recurrence. Every Ulam sequence is literally generated by a history-dependent recurrence; Ulam membership adds a number-theoretic unique-sum and least-next predicate. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Ulam number adds domain-specific constraints.

The entry does not collapse into that parent because the conjunction of greedy minimality, distinct-summand use, exact uniqueness, and dependence on the evolving admitted set It also declines a broader thematic neighbor: shared vocabulary does not establish literal structural subsumption. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge.

The prospective workspace queue contains one strict upward edge to prime:recurrence. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Ulam number Domain-specific

Parents (1) — more general patterns this builds on

Ulam number is a kind of Recurrence Prime

The proposed strict upward parent is prime:recurrence.

Hierarchy path (1) — routes to 1 parentless root

Ulam number → Recurrence

Neighborhood in Abstraction Space¶

Ulam number sits in a moderately populated region (53^rd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Recursive Patterns & Decomposition (5 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Ulam spiral. A spatial display of integers highlighting primes, not this sequence.
Stanley sequence. A greedy sequence avoiding arithmetic progressions, with a different eligibility predicate.
Sidon sequence. A set whose pair sums satisfy uniqueness constraints globally rather than a least-next Ulam rule.
Additive basis. A set judged by representational coverage, not exact one-representation admission.

References¶

[1] Stanisław Ulam, 'Combinatorial Analysis in Infinite Sets and Some Physical Theories,' SIAM Review 6(4), 343–355 (1964), DOI 10.1137/1006090. registry ↩a ↩b

[2] James H. Schmerl and Eugene Spiegel, 'The Regularity of Some 1-Additive Sequences,' Journal of Combinatorial Theory A 66(1), 172–175 (1994), DOI 10.1016/0097-3165(94)90058-2. registry ↩a ↩b

[3] Joshua Hinman et al., 'The Unreasonable Rigidity of Ulam Sets,' Experimental Mathematics 28(3), 277–283 (2019), DOI 10.1080/10586458.2017.1395385. registry ↩