EPISODE · Jun 11, 2025 · 11 MIN
OEIS A000246: Permutations with only odd-length cycles
from Intellectually Curious · host Mike Breault
We explore A000246—the count of permutations of n elements whose cycle decomposition uses only odd-length cycles. Key ideas: every counted permutation is even (each odd-length cycle is an even permutation, and the product of evens is even); the remarkable equivalence with ballot permutations; the neat closed forms a(2m) = ((2m−1)!!)^2 and a(2m+1) = (2m+1)!!(2m−1)!!; and how these two very different descriptions count the same objects. We’ll walk through small n (1→1, 2→1, 3→3, 4→9, 5→45, 6→225), explain the double-factorial formulas, and touch on the recurrence and the broader connections that make this OEIS entry a beautiful bridge between cycle structure and ballot sequences.Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.Sponsored by Embersilk LLC
Embed this episode
What this episode covers
We explore A000246—the count of permutations of n elements whose cycle decomposition uses only odd-length cycles. Key ideas: every counted permutation is even (each odd-length cycle is an even permutation, and the product of evens is even); the remarkable equivalence with ballot permutations; the neat closed forms a(2m) = ((2m−1)!!)^2 and a(2m+1) = (2m+1)!!(2m−1)!!; and how these two very different descriptions count the same objects. We’ll walk through small n (1→1, 2→1, 3→3, 4→9, 5→45, 6→22...
NOW PLAYING
OEIS A000246: Permutations with only odd-length cycles
No transcript for this episode yet
Similar Episodes
No similar episodes found.
Similar Podcasts
No similar podcasts found.