|
%I #27 Oct 31 2020 03:46:43
%S 1,1,1,2,1,2,3,1,1,3,4,1,2,1,4,5,1,1,1,1,5,6,1,2,3,1,1,1,7,1,1,1,1,1,
%T 1,7,8,1,2,1,4,1,2,1,8,9,1,1,3,1,1,3,1,1,9,10,1,2,1,2,5,2,1,1,1,5,11,
%U 1,1,1,1,1,1,1,1,1,1,11,12,1,2,3,4,1,3,1,2,3,1,1,6
%N Triangle T(n, k) read by rows: T(n, k) is the denominator of the rational Catalan number defined as binomial(n + k, n)/(n + k) for 0 <= k <= n, n > 0; T(0, 0) = 1.
%H Stefano Spezia, <a href="/A328902/b328902.txt">First 141 rows of the triangle, flattened</a>
%H D. Armstrong, N. A. Loehr, G. S. Warrington, <a href="https://doi.org/10.1007/s00026-015-0293-6">Rational Parking Functions and Catalan Numbers</a>, Annals of Combinatorics (2016), Volume 20, Issue 1, pp 21-58.
%H M. T. L. Bizley, <a href="http://bergeron.math.uqam.ca/wp-content/uploads/2014/09/Bizley.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.
%F T(n, k) = (n + k)/gcd(binomial(n + k, n), n + k) for n > 0.
%e n\k| 0 1 2 3 4 5 6
%e ---+--------------
%e 0 | 1
%e 1 | 1 1
%e 2 | 2 1 2
%e 3 | 3 1 1 3
%e 4 | 4 1 2 1 4
%e 5 | 5 1 1 1 1 5
%e 6 | 6 1 2 3 1 1 1
%e ...
%t Flatten[Join[{1},Table[(n+k)/GCD[n+k,Binomial[n+k,n]],{n,1,12},{k,0,n}]]]
%o (PARI) A328902(n,k)=if(n,(n+k)/gcd(binomial(n+k,n),n+k),1) \\ _M. F. Hasler_, Nov 04 2019
%Y Cf. A000108, A028310 (1st column), A046899, A051162, A328901 (numerator).
%K frac,nonn,tabl
%O 0,4
%A _Stefano Spezia_, Oct 30 2019
|
