arXiv (All)
open access
Counting Survivor Sets: Exponential Equivalence with Prime-Admissible Sets
For each integer $n\geq 1$, let $N(n)$ denote the number of distinct subsets of $\{2,\ldots,n+1\}$ obtained by choosing one forbidden residue class modulo each integer from $2$ to $n$; this is OEIS sequence A396595 (https://oeis.org/A396595). Equivalently, $N(n)$ is the initial-restriction complexit
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
- Closure Points and Forced Residues: An Index-Line Sieve for Twin Primes#1166060
- An Explicit Ramsey Bound for de Polignac Numbers#612726
- An Explicit Ramsey Bound for de Polignac Numbers#611249
- The Totalization-Exception Sequence: _Exception Architecture and the Operability of Absolute Verdicts_#165019
- Signed Sets with Few Subset Sums at the Offset-Two and Next Boundaries: Complete All-Size Classifications#1090119
Record · ID 985874
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