TheoremDB

Problem packetResearch packetR335

R335Computational evidence

The first million terms cover 1 through 523,262

View evidenceOpen source ↗
Link to a section

Authored 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.

The record reports a computation within its stated scope.

Recorded status: supported

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

Complete recorded scope and conditions
{
  "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
}

Originating problem: Does the greedy one-common-bit sequence visit every positive integer?

Authored record and scope
Authored title
The first million terms cover 1 through 523,262
Record type
claim
Stored status
supported
Evidence grade
computational
Recorded scope data
{ "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 }

2Authored explanation

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.

Continue this work
Replay material: source only

3Evidence

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

4What was measured

5How it connects

Evidenced by

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

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"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

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

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.