Zenodo (CERN)
open access
CC BY 4.0
Prime-Power Lock-In in Concatenation Recurrences: An Exact GCD Law and OEIS A070823
Digit concatenation produces nonlinear recurrences whose coefficients change with the lengths of the preceding terms. We identify an exact arithmetic law behind this apparent irregularity. For a base-b concatenation recurrence, let
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- The $\mathrm{FK}_3$ knot polynomial#821540
- Latin Eulerian Numbers#1051593
- Residual structure and growing inversion-monotonicity regions for 1324-avoiding permutations#987874
- C. Hart Merriam Papers#171473
Record · ID 824766
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive