Combinatorics / CONCEPT
Padovan Counting Recurrence
The good-word counts satisfy a recurrence involving the auxiliary classes.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH8
DOCUMENT LINKS1
Good-word cardinality recurrence
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Decomposing Padovan Cycle Wordsstructural-affinity · Closed
- Four-Branch Decompositionstructural-affinity · Closed
- Insertion Branches for Padovan Wordsstructural-affinity · Closed
- Padovan Enumeration of Cyclic Avoidersstructural-affinity · Closed
- Rooted Cycle-Word Classesstructural-affinity · Closed
- Successors of Padovan Cycle Wordsstructural-affinity · Closed
- Tetranacci Enumeration of Cyclic Avoidersstructural-affinity · Closed
- Uniqueness of the Padovan Subsequencestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance