|
|
A274052
|
|
Number of factor-free Dyck words with slope 5/2 and length 7n.
|
|
8
|
|
|
1, 3, 13, 94, 810, 7667, 76998, 805560, 8684533, 95800850, 1076159466, 12268026894, 141565916433, 1650395185407, 19409211522550, 229984643863260, 2743097412254490, 32907239462485422, 396793477697214450, 4806417317271974580, 58460150525944945840, 713685698665966837135, 8742060290902752902340
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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 sub-path of smaller size.
|
|
LINKS
|
Cyril Banderier, Michael Wallner, Lattice paths of slope 2/5, 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO).
|
|
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 sub-path of small size; e.g., EEENNNENNNNNNN is a factor-free Dyck word but ENNEENENNNNNNN contains the factor ENENNNN.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|