Combinatorics / CONCEPT
The One-Common-Zeckendorf-Term Greedy Permutation
The least-unused one-common-Zeckendorf-term sequence is total and enumerates every positive integer exactly once.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
A370630 is a positive-integer permutation
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Canonical Interchangeabilitystructural-affinity · Closed
- Extremal Fibonacci Window Widthsstructural-affinity · Closed
- Geometric Weights No-Gostructural-affinity · Closed
- Golden Base-Four Digit Oraclestructural-affinity · Closed
- Golden Namesstructural-affinity · Closed
- Raw W-Digit Stringsstructural-affinity · Closed
- The Zeckendorf Up-Shift Displacement Decode Is a Golden Beatty Readingstructural-affinity · Closed
- W-Digit Conventionstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance