cp's OEIS Frontend

A006149 Number of 3-tuples (p_1, p_2, p_3) of Dyck paths of semilength n, such that each p_i is never below p_{i-1}.

%I A006149 M3634 #70 Sep 20 2024 04:14:17
%S A006149 1,1,4,30,330,4719,81796,1643356,37119160,922268360,24801924512,
%T A006149 713055329720,21706243125300,694280570551875,23188541161342500,
%U A006149 804601696647424500,28880966163870711000,1068595748063216307000,40631980618055892780000,1583603339463794983230000
%N A006149 Number of 3-tuples (p_1, p_2, p_3) of Dyck paths of semilength n, such that each p_i is never below p_{i-1}.
%C A006149 a(n) is the determinant of the 3 X 3 Hankel matrix [a_0, a_1, a_2 ; a_1, a_2, a_3 ; a_2, a_3, a_4] with a_j=A000108(n+j). - _Philippe Deléham_, Apr 12 2007
%C A006149 Third subdiagonal in A123352, equivalent to the 6th subdiagonal in A185249, its "aerated" version with additional subdiagonals entirely filled with zeros. - _R. J. Mathar_, Feb 18 2011
%D A006149 S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (see p. 183).
%D A006149 M. de Sainte-Catherine, Couplages et Pfaffiens en Combinatoire, Physique et Informatique. Ph.D Dissertation, Université Bordeaux I, 1983.
%D A006149 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006149 G. C. Greubel, <a href="/A006149/b006149.txt">Table of n, a(n) for n = 0..564</a>
%H A006149 Myriam de Sainte-Catherine, <a href="/A005700/a005700_1.pdf">Couplages et Pfaffiens en Combinatoire, Physique et Informatique</a>, PhD Dissertation, Université Bordeaux I, 1983. (Annotated scanned copy of pages III.42-III.45)
%H A006149 Nicholas M. Katz, <a href="https://web.math.princeton.edu/~nmk/catalan11.pdf">A Note on Random Matrix Integrals, Moment Identities, and Catalan Numbers</a>, 2015.
%F A006149 G.f.: Hypergeometric 4_F_3 ( [ 1, 1/2, 5/2, 3/2 ]; [ 4, 5, 6 ]; 64 x ).
%F A006149 a(n) = Det[Table[binomial[i+2, j-i+3], {i, 1, n}, {j, 1, n}]]. - _David Callan_, Jul 20 2005
%F A006149 a(n) = 720 (2*n)! (2*n+2)! (2*n+4)! / (n! (n+1)! (n+2)! (n+3)! (n+4)! (n+5)!). - _Steven Finch_, Mar 30 2008
%F A006149 (n+5)*(n+4)*(n+3)*a(n) -8*(2*n+3)*(2*n+1)*(2*n-1)*a(n-1)=0. - _R. J. Mathar_, Feb 27 2018
%F A006149 From _Peter Bala_, Feb 22 2023: (Start)
%F A006149 a(n) = Product_{1 <= i <= j <= n-1} (i + j + 6)/(i + j).
%F A006149 a(n) = (1/2^(n-1)) * Product_{1 <= i <= j <= n-1} (i + j + 6)/(i + j - 1) for n >= 1. (End)
%F A006149 a(n) ~ 45 * 2^(6*n + 10) / (Pi^(3/2) * n^(21/2)). - _Vaclav Kotesovec_, Feb 23 2023
%p A006149 seq(6!*(2*n)!*(2*n+2)!*(2*n+4)!/mul((n+j)!, j=0..5), n=0..20); # _G. C. Greubel_, Aug 28 2019
%t A006149 Table[6!*(2*n)!*(2*n+2)!*(2*n+4)!/Product[(n+j)!, {j,0,5}], {n,0,20}] (* _G. C. Greubel_, Aug 28 2019 *)
%o A006149 (PARI) vector(20, n, 6!*(2*n-2)!*(2*n)!*(2*n+2)!/prod(j=0,5, (n+j-1)!) ) \\ _G. C. Greubel_, Aug 28 2019
%o A006149 (Magma) F:=Factorial; [F(6)*F(2*n)*F(2*n+2)*F(2*n+4)/&*[F(n+j): j in [0..5]] : n in [0..20]]; // _G. C. Greubel_, Aug 28 2019
%o A006149 (Sage) f=factorial; [f(6)*f(2*n)*f(2*n+2)*f(2*n+4)/product(f(n+j) for j in (0..5)) for n in (0..20)] # _G. C. Greubel_, Aug 28 2019
%o A006149 (GAP) F:=Factorial;; List([0..20], n-> F(6)*F(2*n)*F(2*n+2)*F(2*n+4) /Product([0..5], j-> F(n+j) ) ); # _G. C. Greubel_, Aug 28 2019
%Y A006149 Cf. A000108, A005700, A006150, A006151.
%Y A006149 Column k=3 of A078920.
%Y A006149 Diagonal of A123352 and of A185249.
%K A006149 nonn,easy
%O A006149 0,3
%A A006149 _N. J. A. Sloane_, _Simon Plouffe_
%E A006149 Name clarified by _Alois P. Heinz_, Feb 24 2023