|
%I #22 Sep 08 2022 08:45:03
%S 0,3,12,45,168,630,2376,9009,34320,131274,503880,1939938,7488432,
%T 28973100,112326480,436268025,1697168160,6611884290,25792489800,
%U 100734001830,393847225200,1541374822260,6037849200240,23671113341850
%N a(n) = 3*binomial(2*n, n-1).
%C a(n) equals 2^(3+2n) times the coefficient of Pi in 2F1(1/2, n+2, 5/2, -1). - _John M. Campbell_, Jul 17 2011
%C The array view of A029635 is
%C 2, 2, 2, 2, 2, 2, ...
%C 1, 3, 5, 7, 9, 11, ...
%C 1, 4, 9, 16, 25, 36, ...
%C 1, 5, 14, 30, 55, 91, ...
%C 1, 6, 20, 50, 105, 196, ...
%C 1, 7, 27, 77, 182, 378, ...
%C and a(n) is the incomplete hook sum Sum_{k=0..n-1} A(n,k) + Sum_{r=0..n-1} A(r,n). - _R. J. Mathar_, Jun 30 2013
%H Harry J. Smith, <a href="/A062561/b062561.txt">Table of n, a(n) for n = 0..200</a>
%t Table[3*Binomial[2*n, n-1], {n, 0, 25}]
%o (PARI) for(n=0,22,print(3*binomial(2*n,n-1)))
%o (PARI) { for (n=0, 200, write("b062561.txt", n, " ", 3*binomial(2*n, n - 1)) ) } \\ _Harry J. Smith_, Aug 08 2009
%o (Magma) [3*n*Catalan(n): n in [0..30]]; // _Vincenzo Librandi_, Jul 19 2011
%Y Cf. A001791.
%K easy,nonn
%O 0,2
%A _Jason Earls_, Jul 13 2001
|
