Second Order Eulerian Number Calculator

Start from the one-entry base row and build each bounded row with the second-order Eulerian two-predecessor recurrence. The indexing, equivalence relation, and counted objects are stated in the method and worked example. Inputs must be whole numbers inside the displayed domain; the page never rounds a decimal into an accepted index. This ties the answer to one explicit convention instead of silently mixing sequence offsets or combinatorial interpretations.

This ascent distribution belongs to Stirling permutations and differs from first-order Eulerian numbers. Small boundary cases and the displayed recurrence or identity provide useful independent checks. Recompute the displayed recurrence or closed form with the same inputs and compare its previous terms or counting factors. That check supports this bounded result, but it does not transfer the interpretation to a different sequence or counting object.

Indexing conventions vary in references; this page states and tests its zero-based k convention. The implementation uses integer arithmetic internally and refuses results beyond the safe display boundary. Combinatorial and recurrence values can grow rapidly even when the inputs look small. The conservative cap prevents browser stalls and avoids presenting an unsafe floating-point integer as exact; larger work needs arbitrary-precision software and independent resource controls.