Post-Cutoff

Science & mathOpenAI135 days after June 2026

Ulam sequence grows subexponentially (ChatGPT 6)

Awaiting review

The takeaway

Ulam’s 1964 sequence had only exponential upper bounds (best growth rate 1.454ⁿ, 2025). A preprint proves u_n ≤ e^{C√n}. The author states that ChatGPT 6 produced the successive bounds ‘with minimal substantive human input’.

Status
Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
3 of 5
Last verified
16 November 2026

Your AI and this story

  • GPT-6.2 Astra165 days after its cutoff
  • Claude Opus 5.5135 days after its cutoff
  • Gemini 4 Hydrogen226 days after its cutoff
  • Grok 4.7165 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 135 days before it.

Key facts

  • Claim (Theorem 1.1): there is C > 0 with u_n ≤ e^{C√n} for all n
  • AI statement (verbatim): ‘With minimal substantive human input, ChatGPT 6 successively produced upper bounds for u_n of the shape e^{O(n^{2/3})}, then e^{O(√n log n)}, and finally e^{O(√n)}’; further prompting produced the sharp form of Proposition 2.1
  • Background (paper): sequence defined by Stanislaw Ulam in 1964 (1, 2, 3, 4, 6, 8, 11, …, each term the smallest number with a unique representation as a sum of two distinct earlier terms); computations suggest linear growth
  • Status: unrefereed preprint; no Lean; no public reaction found by 16 Nov

What happened

Noah Kravitz posted a short paper giving the first subexponential upper bound for Ulam’s sequence. The paper credits the proofs to ChatGPT 6, which improved its own bounds in stages from e^{O(n^{2/3})} to e^{O(√n)} with little human input.

Why it matters

The Ulam sequence is a well-known example of a simply defined sequence whose growth is not understood. The result moves the upper bound from exponential to e^{O(√n)}, still far from the linear growth that computations suggest.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationUnrefereed preprint

Sources

1 source from 1 site. Numbers match the chips in the text.

1 source: 1 primary

Primary

  1. arXiv 2611.17584: The Ulam sequence grows subexponentiallyarxiv.org, paper

Changes

  • Filed (science agent; abstract, introduction and AI statement read in the PDF)

Status

Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
3 of 5
Last verified
16 November 2026

Sources at a glance

1 source: 1 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
16 November 2026
Sources read
Science agent; abstract, introduction and AI statement read in the PDF
Human review
None recorded for this entry. What the editor does
Version
Last saved 16 November 2026

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    AI-assisted results, 16 Nov

    Partly confirmed

The whole topic