OFFSET
0,4
COMMENTS
Also the number of 123-avoiding parking functions of size n having exactly k ascents.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..2600 (rows 0..100)
Richard Ehrenborg, Gábor Hetyei, and Margaret Readdy, Parking trees and the toric g-vector of nestohedra, arXiv:2511.04815 [math.CO], 2025.
FORMULA
T(n,k) = Sum_{j=0..floor(n/2)} Sum_{i=0..min(floor(n/2),n-j)} (binomial(2*j, j)/(j+1)) * binomial(n,2*j) * binomial(2*n-2*i-2*j,n-i-j) * binomial(n-i,i) * (-1)^(i-k) * binomial(i,k)/(n-i-j+1).
G.f. of row n: Sum_{j=0..floor(n/2)} (binomial(2*j,j)/(j+1)) * binomial(n,2*j) * Sum_{k=0..min(floor(n/2),n-j)} binomial(2*(n-k-j),n-k-j) * binomial(n-k,k) * (x-1)^k / (n-k-j+1).
T(2*n,n) = A005568(n).
T(2*n+1,n) = A046715(n+1).
EXAMPLE
T(4,2) = 10 since there are 10 parking functions of length 4 that are 123-avoiding and have exactly 2 ascents: 2211, 2311, 2312, 2411, 2412, 2413, 3311, 3312, 3411 and 3412.
Triangle begins:
1;
1;
1, 2;
1, 10;
1, 37, 10;
1, 126, 105;
1, 422, 714, 70;
1, 1422, 4032, 1176;
1, 4853, 20628, 11928, 588;
1, 16786, 99495, 95040, 13860;
1, 58775, 461945, 656205, 189090, 5544;
...
MAPLE
proc(n, k) local j, i; add(binomial(2*j, j)*binomial(n, 2*j)*add(binomial(2*n-2*i-2*j, n-i-j)*binomial(n-i, i)*(-1)^(i-k)*binomial(i, k)/(n-i-j+1), i=0..min(floor(1/2*n), n-j))/(j+1), j=0..floor(1/2*n)); end proc
PROG
(PARI) T(n, k) = {sum(j=0, n\2, sum(i=0, min(n\2, n-j), (binomial(2*j, j)/(j+1)) * binomial(n, 2*j) * binomial(2*n-2*i-2*j, n-i -j) * binomial(n-i, i) * (-1)^(i-k) * binomial(i, k)/(n-i-j+1) ))} \\ Andrew Howroyd, Nov 27 2025
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Richard Ehrenborg, Nov 22 2025
STATUS
approved
