OFFSET
0,2
COMMENTS
a(n) is the number of lattice paths (allowing only north and east steps) starting at (0,0) and ending at (2n,5n) that stay below the line y = 5/2x and also do not contain a proper subpath of smaller size.
LINKS
Cyril Banderier and Michael Wallner, Lattice paths of slope 2/5, 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO).
Daniel Birmajer, Juan B. Gil, and Michael D. Weiner, On rational Dyck paths and the enumeration of factor-free Dyck words, arXiv:1606.02183 [math.CO], 2016.
Daniel Birmajer, Juan B. Gil, and Michael D. Weiner, On factor-free Dyck words with half-integer slope, arXiv:1804.11244 [math.CO], 2018.
P. Duchon, On the enumeration and generation of generalized Dyck words, Discrete Mathematics, 225 (2000), 121-135.
FORMULA
Conjectural o.g.f.: Let E(x) = exp( Sum_{n >= 1} binomial(7*n, 2*n)*x^n/n ). Then A(x) = ( x/series reversion of x*E(x) )^(1/7) = 1 + 3*x + 13*x^2 + 94*x^3 + ... . Equivalently, [x^n]( A(x)^(7*n) ) = binomial(7*n, 2*n) for n = 0,1,2,... . - Peter Bala, Jan 01 2020
EXAMPLE
a(2) = 13 since there are 13 lattice paths (allowing only north and east steps) starting at (0,0) and ending at (4,10) that stay below the line y=5/2x and also do not contain a proper subpath of small size; e.g., EEENNNENNNNNNN is a factor-free Dyck word but ENNEENENNNNNNN contains the factor ENENNNN.
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael D. Weiner, Jun 08 2016
STATUS
approved