{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R337",
  "content_hash": null,
  "slug": "gocb-claim-oeis-identification",
  "type": "claim",
  "title": "The sequence is OEIS A226077",
  "summary": "Paul Tek submitted the same greedy binary-support recurrence to OEIS in 2013.",
  "relevance": "For Does the greedy one-common-bit sequence visit every positive integer?, record gocb-claim-oeis-identification (“The sequence is OEIS A226077”) records a bound, answer, status fact, or structural consequence. The record states: Paul Tek submitted the same greedy binary-support recurrence to OEIS in 2013.",
  "relevance_source": "recorded",
  "body": "OEIS A226077 starts with \\(a(1)=1\\) and chooses the smallest unused positive integer sharing exactly one 1-bit with its predecessor. This is the candidate recurrence word for word. Paul Tek submitted the entry on May 25, 2013. Reinhard Zumkeller supplied a Haskell generator the following day.\n\nThe OEIS b-file contains 10,000 terms. An independent parser compared every one with the direct greedy generator used for this entry. All terms agree. The compact JSON vector has SHA-256 digest `9f2304a259bb7ea43816fe6a1a61e322f67ecfe4fae172219da70034905ce505`; its last term is 10,391 and its maximum is 16,401.",
  "status": "established",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "universal",
    "statement": "the recursively defined sequence at every index where it is generated"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://oeis.org/A226077",
      "locator": "OEIS A226077, definition, author field, program, and b226077.txt; termwise comparison rerun 2026-07-24"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://oeis.org/A226077",
    "locator": "OEIS A226077, definition, author field, program, and b226077.txt; termwise comparison rerun 2026-07-24"
  },
  "models": [],
  "relations": [
    {
      "slug": "R333",
      "title": "Million-term exact greedy certificate",
      "object_type": "artifact",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "R333",
      "title": "Million-term exact greedy certificate",
      "object_type": "artifact",
      "relation": "tests",
      "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"
    }
  ]
}