OFFSET
1,5
COMMENTS
Row sums = A007476 starting (1, 2, 4, 9, 23, 65, 199, 654, 2296, 8569, ...).
a(n,k) counts restricted growth words of length n in the letters {1, ..., k} where every even entry appears exactly once.
LINKS
Yue Cai and Margaret Readdy, Negative q-Stirling numbers, arXiv:1506.03249 [math.CO], 2015.
FORMULA
a(n,k) = a(n-1,k-1) + ceiling(k/2)*a(n-1,k) for n >= 1 and 1 <= k <= n with boundary conditions a(n,0) = KroneckerDelta[n,0].
a(n,2) = n-1.
a(n,n-1) = floor(n/2)*ceiling(n/2).
EXAMPLE
a(4,1) = 1 via 1111;
a(4,2) = 3 via 1211, 1121, 1112;
a(4,3) = 4 via 1213, 1231, 1233, 1123;
a(4,4) = 1 via 1234.
Triangle starts:
1;
1, 1;
1, 2, 1;
1, 3, 4, 1;
1, 4, 11, 6, 1;
...
MATHEMATICA
a[_, 1] = a[n_, n_] = 1;
a[n_, k_] := a[n, k] = a[n-1, k-1] + Ceiling[k/2] a[n-1, k];
Table[a[n, k], {n, 1, 10}, {k, 1, n}] // Flatten (* Jean-François Alcover, Dec 15 2018 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Margaret A. Readdy, Mar 16 2015
STATUS
approved