Extension and Algorithmic Analysis of OEIS Sequences A046235 and A377466

This deposit provides formal mathematical proofs, algorithms, and computational verification for new extensions to two active sequences in the On-Line Encyclopedia of Integer Sequences (OEIS): 1. OEIS A046235 (Base-6 Palindromic Cubes): Proves the Base-6 Palindromic Cube Theorem showing that (6^n + 1)^3 is strictly a base-6 palindrome for all integers n >= 1. Computes sequence extensions a(16) through a(21), breaking the 20-year-old bound of 10^10 established in 2006. 2. OEIS A377466 (Prime Gaps Containing Multiple Perfect Powers): Formulates the Inverse Power Gap Theorem, reducing search complexity from O(pi(N)) to O(sqrt(N)). Proves exhaustively that no additional prime gaps containing multiple perfect powers exist below 10^18, confirming all 10 published terms and establishing a(11) > 10^18. Includes full reproduction code in Python (SymPy) and high-performance C++.

Authors

Publication Details

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

Extension and Algorithmic Analysis of OEIS Sequences A046235 and A377466

Abhi Dinkale
4 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Extension and Algorithmic Analysis of OEIS Sequences A046235 and A377466

Abhi Dinkale
preprint en

Abstract

This deposit provides formal mathematical proofs, algorithms, and computational verification for new extensions to two active sequences in the On-Line Encyclopedia of Integer Sequences (OEIS): 1. OEIS A046235 (Base-6 Palindromic Cubes): Proves the Base-6 Palindromic Cube Theorem showing that (6^n + 1)^3 is strictly a base-6 palindrome for all integers n >= 1. Computes sequence extensions a(16) through a(21), breaking the 20-year-old bound of 10^10 established in 2006. 2. OEIS A377466 (Prime Gaps Containing Multiple Perfect Powers): Formulates the Inverse Power Gap Theorem, reducing search complexity from O(pi(N)) to O(sqrt(N)). Proves exhaustively that no additional prime gaps containing multiple perfect powers exist below 10^18, confirming all 10 published terms and establishing a(11) > 10^18. Includes full reproduction code in Python (SymPy) and high-performance C++.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
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