OEIS A000295: The one-descent Eulerian numbers (and why they’re not Euler’s triangle) episode artwork

EPISODE · Aug 3, 2025 · 5 MIN

OEIS A000295: The one-descent Eulerian numbers (and why they’re not Euler’s triangle)

from Intellectually Curious · host Mike Breault

In this episode we untangle OEIS A000295, the sequence that appears with Eulerian-number flavor but isn’t the classic geomet rics Euler triangle. The entries 0, 0, 1, 4, 11, 26, 57 follow the closed form a(n) = 2^n − n − 1 for n ≥ 0. We’ll explore two equivalent combinatorial interpretations: - a(n) counts permutations of {1,...,n} that have exactly one descent; and - a(n) counts the nonempty subsets of an n-element set that have size at least 2.For example, n = 3 gives a(3) = 4 and n = 4 gives a(4) = 11.We’ll briefly connect this to Eulerian numbers A(n,k) with k = 1, and explain how a single sequence can arise from a simple triangle-like counting rule.Next, we pivot to the geometric side often associated with Euler: the Euler triangle and the Euler line. This is a separate concept from the OEIS sequence. The geometric Euler triangle is formed using the orthocenter, and its associated nine-point circle and the Euler line tie together orthocenter, circumcenter, centroid, and nine-point center. We’ll outline the key facts and the special cases (right and isosceles triangles) that make this a striking geometric structure.Bottom line: two very different Euler-related ideas share a name but belong to different branches of math—one a tidy combinatorial count, the other a rich geometric configuration. Both testify to Euler’s deep influence across mathematics.Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.Sponsored by Embersilk LLC

Episode metadata supplied by the publisher feed · Published Aug 3, 2025

Embed this episode

In this episode we untangle OEIS A000295, the sequence that appears with Eulerian-number flavor but isn’t the classic geomet rics Euler triangle. The entries 0, 0, 1, 4, 11, 26, 57 follow the closed form a(n) = 2^n − n − 1 for n ≥ 0. We’ll explore two equivalent combinatorial interpretations: - a(n) counts permutations of {1,...,n} that have exactly one descent; and - a(n) counts the nonempty subsets of an n-element set that have size at least 2.For example, n = 3 gives a(3) = 4 and n = 4 giv...

Distinct summary based on available episode metadata or transcript content.

NOW PLAYING

OEIS A000295: The one-descent Eulerian numbers (and why they’re not Euler’s triangle)

0:00 5:11

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Intellectually Curious?

This episode is 5 minutes long.

When was this Intellectually Curious episode published?

This episode was published on August 3, 2025.

Can I download this Intellectually Curious episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!