cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Kyle Celano

Kyle Celano's wiki page.

Kyle Celano has authored 1 sequences.

A386011 Total number of inversions in all parking functions of length n.

Original entry on oeis.org

0, 1, 18, 300, 5400, 108045, 2408448, 59521392, 1620000000, 48230748225, 1560833556480, 54591962772204, 2053129541019648, 82648417236328125, 3546584706554265600, 161642713497024891840, 7799116552647941947392, 397183826482614347896737
Offset: 1

Author

Kyle Celano, Jul 14 2025

Keywords

Examples

			a(2)=1 because in the 3 parking functions of length 2 (11, 12, 21), there is 1 inversion: (1,2).
		

Crossrefs

Programs

  • Mathematica
    Table[Binomial[n,2] * n*(n+1)^(n-2)/2, {n, 0, 18}]

Formula

a(n) = binomial(n,2) * n*(n+1)^(n-2)/2.
a(n) = Sum_{k=0..binomial(n,2)} A152290(n,k)*k.
a(n) = binomial(n,2)*A055865(n)/2.