A comparison theorem for the Hofstadter–Conway $10,000 sequence and its alternating variant

The Hofstadter–Conway sequence c(n) = c(c(n−1)) + c(n−c(n−1)) (OEIS A004001) and Alkan's companion s(n) = n − s(s(n−1)) − s(n−s(n−1)) (OEIS A287422) both trace arches over the dyadic blocks [2k, 2k+1]. We prove Alkan's conjecture that |s(n) − n/2| ≤ c(n) − n/2 for every n ≥ 1. Both sequences are encoded on each block by Dyck words, and the words for the next block come from the previous ones by two explicit threshold operators; a stronger hypothesis is carried through two blocks at a time. The proof reproves that s is well defined and slow, as stated earlier by Alkan and Aybar. The lemmas, the block proposition and the theorem are formally verified in Lean 4. This record is identical to the folder hofstadter-conway-comparison at tag hofstadter-conway-comparison-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (8 October 2026) was released on GitHub only.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24366938
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A comparison theorem for the Hofstadter–Conway $10,000 sequence and its alternating variant

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

A comparison theorem for the Hofstadter–Conway $10,000 sequence and its alternating variant

Vamshi Jandhyala
preprint en

Abstract

The Hofstadter–Conway sequence c(n) = c(c(n−1)) + c(n−c(n−1)) (OEIS A004001) and Alkan's companion s(n) = n − s(s(n−1)) − s(n−s(n−1)) (OEIS A287422) both trace arches over the dyadic blocks [2k, 2k+1]. We prove Alkan's conjecture that |s(n) − n/2| ≤ c(n) − n/2 for every n ≥ 1. Both sequences are encoded on each block by Dyck words, and the words for the next block come from the previous ones by two explicit threshold operators; a stronger hypothesis is carried through two blocks at a time. The proof reproves that s is well defined and slow, as stated earlier by Alkan and Aybar. The lemmas, the block proposition and the theorem are formally verified in Lean 4. This record is identical to the folder hofstadter-conway-comparison at tag hofstadter-conway-comparison-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (8 October 2026) was released on GitHub only.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon