OFFSET
0,3
COMMENTS
From Yu Hin Au, Jan 21 2026: (Start)
a(n) = number of operator monomials M in a 6-ary associative algebra with a unary linear operator L, where M has n-1 total operations. E.g., the a(3) = 9 such operator monomials are L(L(a)), L(abcdef), L(a)bcdef, aL(b)cdef, abL(c)def, abcL(d)ef, abcdL(e)f, abcdeL(f), and abcdefghijk.
a(n) = number of labeled Schröder paths of semilength n-1 avoiding DDDDDD where each descent (maximal sequence run of down steps) of length l>=2 is labeled by a (l-1)-subset of {1,2,3,4}. E.g., the a(3) = 9 such paths are
- UU(DD)_S where S belongs to {{1}, {2}, {3}, {4}};
- UHD, UDUD, UDH, HUD, and HH.
a(n) = number of labeled Dyck paths of semilength n, where every non-terminal descent of length l>=2 is labeled by a composition of l-1 consisting of 5 nonnegative parts (the final descent is unlabeled). E.g., the a(3) = 9 such paths are
- UUUDDD, UUDUDD, UDUUDD, UDUDUD;
- UU(DD)_SUD where S belongs to {(1,0,0,0,0), (0,1,0,0,0), (0,0,1,0,0), (0,0,0,1,0), (0,0,0,0,1)}. (End)
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..1000
Yu Hin Au and Murray R. Bremner, A new generalization of the Narayana numbers inspired by linear operators on associative d-ary algebras, arXiv:2511.13671 [math.CO], 2025. See p. 2, Table 2.
FORMULA
a(n) = (1/n) * Sum_{k=0..n-1} binomial(n,k) * binomial(n+4*k,n-1-k) for n > 0.
G.f.: 1 + Series_Reversion( x / (1 + x + x * (1 + x)^5) ). - Seiichi Manyama, Oct 03 2025
G.f.: 1/(1 - x*B(x)), where B(x) is the g.f. of A321799. - Seiichi Manyama, Dec 15 2025
MATHEMATICA
{1}~Join~Table[(1/n)*Sum[Binomial[n, k]*Binomial[n + 4*k, n - 1 - k], {k, 0, n - 1}], {n, 23}] (* Michael De Vlieger, Nov 26 2025 *)
PROG
(PARI) a(n) = if(n==0, 1, sum(k=0, n-1, binomial(n, k)*binomial(n+4*k, n-1-k))/n);
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Aug 05 2023
STATUS
approved