login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A300390 The number of paths of length 7*n from the origin to the line y = 3*x/4 with unit east and north steps that stay below the line or touch it. 1

%I #30 Jan 03 2020 11:32:56

%S 1,5,227,15090,1182187,101527596,9247179818,877362665128,

%T 85783306955099,8582893111512001,874542924575207352,

%U 90437361732467946334,9467275300762187682554,1001309098267187214993056,106836493655355495755649544,11485688815900189437990930096,1242964338344397490958154292155

%N The number of paths of length 7*n from the origin to the line y = 3*x/4 with unit east and north steps that stay below the line or touch it.

%C Equivalent to nonnegative walks from (0,0) to (7*n,0) with step set [1,3], [1,-4].

%H M. T. L. Bizley, <a href="/A060941/a060941.pdf">Derivation of a new formula for the number of minimal lattice paths from (0, 0) to (km, kn) having just t contacts with the line my = nx and having no points above this line; and a proof of Grossman's formula for the number of paths which may touch but do not rise above this line</a>, Journal of the Institute of Actuaries, Vol. 80, No. 1 (1954): 55-62. [Cached copy]

%H Bryan Ek, <a href="https://arxiv.org/abs/1803.10920">Lattice Walk Enumeration</a>, arXiv:1803.10920 [math.CO], 2018.

%H Bryan Ek, <a href="https://arxiv.org/abs/1804.05933">Unimodal Polynomials and Lattice Walk Enumeration with Experimental Mathematics</a>, arXiv:1804.05933 [math.CO], 2018.

%F G.f. satisfies: f = f^35*t^5 - f^31*t^4 + f^30*t^4 - f^29*t^4 + 5*f^28*t^4 - f^25*t^3 + f^24*t^3 + 3*f^23*t^3 - 4*f^22*t^3 + 10*f^21*t^3 + f^19*t^2 - f^18*t^2 + 5*f^17*t^2 + 3*f^16*t^2 - 6*f^15*t^2 + 10*f^14*t^2 + f^13*t - f^12*t + 3*f^10*t + f^9*t - 4*f^8*t + 5*f^7*t + 1.

%F From _Peter Bala_, Jan 03 2019: (Start)

%F O.g.f.: A(x) = exp( Sum_{n >= 1} (1/7)*binomial(7*n, 3*n)*x^n/n ) - Bizley.

%F Recurrence: a(0) = 1 and a(n) = (1/n) * Sum_{k = 0..n-1} (1/7)*binomial(7*n-7*k, 3*n-3*k)*a(k) for n >= 1. (End)

%e For n=1, the possible walks are EEEENNN, EEENENN, EENEENN, EEENNEN, EENENEN.

%t m = 17; f = 0; Do[f = f^35*t^5 - f^31*t^4 + f^30*t^4 - f^29*t^4 + 5*f^28*t^4 - f^25*t^3 + f^24*t^3 + 3*f^23*t^3 - 4*f^22*t^3 + 10*f^21*t^3 + f^19*t^2 - f^18*t^2 + 5*f^17*t^2 + 3*f^16*t^2 - 6*f^15*t^2 + 10*f^14*t^2 + f^13*t - f^12*t + 3*f^10*t + f^9*t - 4*f^8*t + 5*f^7*t + 1 + O[t]^m, {m}]; CoefficientList[f, t] (* _Jean-François Alcover_, Feb 18 2019 *)

%Y Cf. A001764, A060941, A300386, A300387, A300388, A300389, A300391.

%K nonn,walk,easy

%O 0,2

%A _Bryan T. Ek_, Mar 05 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)