OEIS A000255: Euler's permutation sequence

Today on Deep Dive we explore OEIS A000255, Euler's permutation sequence. We trace its origin in Euler’s work on derangements and Euler’s difference table, and see how it counts permutations of n+2 elements that begin with 2 and have no fixed points. We’ll uncover two elegant connections to the derangement numbers A000166: (1) An = A000166(n) + A000166(n+1), a simple additive bridge between adjacent derangement counts, and (2) the interpretation as the number of derangements of n+2 that start with 2, linking Euler’s construction to a crisp combinatorial motif. We’ll also examine the recurrence An = An−1 + (n−1) An−2 and what it reveals about growth and structure. Tune in for concrete examples, the historical thread behind the notation, and why this sequence sits at a beautiful crossroads of classic derangements and Euler’s insight.Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.Sponsored by Embersilk LLC