TheoremDB

Problem packetWorkR335

R335claimStatus: supportedEvidence: ReproducedReplay: source onlyexhaustive over its scope

[#R335] The first million terms cover 1 through 523,262

claim. The first million terms cover every positive integer through 523,262, with 523,263 the least missing value; occurrence of 523,263 and universal coverage remain unproved.

View evidenceOpen source ↗

1Summary

The exact greedy computation tracks a Boolean used table and advances a least-missing pointer after every insertion. At term 1,000,000 the pointer equals 523,263. Hence every integer from 1 through 523,262 has appeared. The last term is 1,109,402, and the largest term seen is 1,573,378.

This is an exhaustive statement about the stated prefix. It supplies finite evidence for the permutation question.

Reproduced evidence. Recorded scope: every positive integer from 1 through 523262 among the first 1000000 terms.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: oeis.org ↗, Executable certificate gocb-artifact-million-term-trie, run 2026-07-24

3What was measured

Terms generated
1,000,000
Least missing
523,263
Last term
1,109,402
Maximum term
1,573,378
Artifact slug
gocb-artifact-million-term-trie

4How it connects

Evidenced by

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R335",
  "content_hash": null,
  "slug": "gocb-claim-coverage-through-523262",
  "type": "claim",
  "title": "The first million terms cover 1 through 523,262",
  "summary": "The first million terms cover every positive integer through 523,262, with 523,263 the least missing value; occurrence of 523,263 and universal coverage remain unproved.",
  "relevance": "For Does the greedy one-common-bit sequence visit every positive integer?, record gocb-claim-coverage-through-523262 (“The first million terms cover 1 through 523,262”) records a bound, answer, status fact, or structural consequence. The record states: The first million terms cover every positive integer through 523,262, with 523,263 the least missing value; occurrence of 523,263 and universal coverage remain unproved.",
  "relevance_source": "recorded",
  "body": "The exact greedy computation tracks a Boolean used table and advances a least-missing pointer after every insertion. At term 1,000,000 the pointer equals 523,263. Hence every integer from 1 through 523,262 has appeared. The last term is 1,109,402, and the largest term seen is 1,573,378.\n\nThis is an exhaustive statement about the stated prefix. It supplies finite evidence for the permutation question.",
  "status": "supported",
  "evidence_grade": "computational",
  "scope": {
    "kind": "bounded",
    "statement": "every positive integer from 1 through 523262 among the first 1000000 terms",
    "bounds": {
      "value": {
        "min": 1,
        "max": 523262
      },
      "term_index": {
        "min": 1,
        "max": 1000000
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://oeis.org/A226077",
      "locator": "Executable certificate gocb-artifact-million-term-trie, run 2026-07-24"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://oeis.org/A226077",
    "locator": "Executable certificate gocb-artifact-million-term-trie, run 2026-07-24"
  },
  "models": [],
  "relations": [
    {
      "slug": "R333",
      "title": "Million-term exact greedy certificate",
      "object_type": "artifact",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R334",
      "title": "The universal permutation claim remains open in the sources checked",
      "object_type": "attempt",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "greedy-one-common-bit-permutation",
      "title": "greedy one common bit permutation",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
greedy-one-common-bit-permutation
Locator
Executable certificate gocb-artifact-million-term-trie, run 2026-07-24
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-24
Public record
R335
Stable alias
gocb-claim-coverage-through-523262
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.