A005809 -id:A005809 - cp's OEIS frontend

A006256 a(n) = Sum_{k=0..n} binomial(3k,k)binomial(3n-3k,n-k).

1, 6, 39, 258, 1719, 11496, 77052, 517194, 3475071, 23366598, 157206519, 1058119992, 7124428836, 47983020624, 323240752272, 2177956129818, 14677216121871, 98923498131762, 666819212874501, 4495342330033938, 30308036621747679, 204356509814519712

Offset: 0

N. J. A. Sloane, Don Knuth

The right-hand sides of several of the "Ruehr identities". - N. J. A. Sloane, Feb 20 2020

Convolution of A005809 with itself. - Emeric Deutsch, May 22 2003

Allouche, J-P. "Two binomial identities of Ruehr Revisited." The American Mathematical Monthly 126.3 (2019): 217-225.
Alzer, Horst, and Helmut Prodinger. "On Ruehr's Identities." Ars Comb. 139 (2018): 247-254.
Bai, Mei, and Wenchang Chu. "Seven equivalent binomial sums." Discrete Mathematics 343.2 (2020): 111691.
M. Petkovsek et al., A=B, Peters, 1996, p. 165.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Jean-Paul Allouche, A generalization of an identity due to Kimura and Ruehr, arXiv preprint arXiv:1706.08929 [math.NT], 2017.
Jean-Paul Allouche, Two exercises of Comtet and two identities of Ruehr, arXiv preprint arXiv:1707.05751 [math.NT], 2017.
Rui Duarte and António Guedes de Oliveira, Short note on the convolution of binomial coefficients, arXiv:1302.2100 [math.CO], 2013 and J. Int. Seq. 16 (2013) #13.7.6.
Shalosh B. Ekhad, Doron Zeilberger, Some Remarks on a recent article by J.-P. Allouche, arXiv:1903.09511 [math.CO], 2019.
N, Kimura and O. G. Ruehr, Change of variable formula for definite integral. Problem E2765, Am. Math. Mnthly, 87, 1980, 307-308.
S. Meehan, A. Tefera, M. Weselcouch, A. Zeleke, Proofs of Ruehr's identities, Integers 14 (2014) A10.
D. Merlini, R. Sprugnoli and M. C. Verri, The tennis ball problem, J. Combin. Theory, A 99 (2002), 307-344 (Y_n for s=3).

Cf. A036829.
Cf. A005809, A160906, A183160, A226751.
Cf. A000302, A078995, A079563, A079678, A079679.
Cf. A141223, A385605, A385632.

a006256 n = a006256_list !! n
a006256_list = f (tail a005809_list) [1] where
   f (x:xs) zs = (sum $ zipWith (*) zs a005809_list) : f xs (x : zs)
-- Reinhard Zumkeller, Sep 21 2014

[&+[Binomial(3*k, k) *Binomial(3*n-3*k, n-k): k in [0..n]]:n in  [0..22]]; // Vincenzo Librandi, Feb 21 2020

a:= proc(n) option remember; `if`(n<2, 5*n+1,
      ((216*n^2-270*n+96) *a(n-1)
      -81*(3*n-2)*(3*n-4) *a(n-2)) /(n*(16*n-8)))
    end:
seq(a(n), n=0..30);  # Alois P. Heinz, Nov 07 2012

a[n_] := HypergeometricPFQ[{1/3, 2/3, 1/2-n, -n}, {1/2, 1/3-n, 2/3-n}, 1]*(3n)!/(n!*(2n)!); Table[a[n], {n, 0, 20}] (* Jean-François Alcover, Jun 20 2012 *)
Table[Sum[Binomial[3k,k]Binomial[3n-3k,n-k],{k,0,n}],{n,0,30}] (* Harvey P. Dale, Oct 23 2013 *)

a(n)=sum(k=0,n, binomial(3*k,k)*binomial(3*n-3*k,n-k)) \\ Charles R Greathouse IV, Feb 07 2017

a = lambda n: binomial(3*n+1,n)*hypergeometric([1,-n],[2*n+2],-2)
[simplify(a(n)) for n in range(20)] # Peter Luschny, May 19 2015

a(n) = (3/4)*(27/4)^n*(1+c/sqrt(n)+o(n^(-1/2))) where c = (2/3)*sqrt(1/(3*Pi)) = 0.217156671956853298... More generally, a(n, m) = sum(k=0, n, C(m*k,k) *C(m*(n-k),n-k)) is asymptotic to (1/2)*m/(m-1)*(m^m/(m-1)^(m-1))^n. See A000302, A078995 for cases m=2 and 4. - Benoit Cloitre, Jan 26 2003, extended by Vaclav Kotesovec, Nov 06 2012
G.f.: 1/(1-3*z*g^2)^2, where g=g(z) is given by g=1+z*g^3, g(0)=1, i.e. (in Maple command) g := 2*sin(arcsin(3*sqrt(3*z)/2)/3)/sqrt(3*z). - Emeric Deutsch, May 22 2003
D-finite with recurrence: 6*(36*n^2-45*n+16)*a(n-1) - 81*(3*n-4)*(3*n-2)*a(n-2) - 8*n*(2*n-1)*a(n) = 0. - Vaclav Kotesovec, Oct 05 2012
From Rui Duarte and António Guedes de Oliveira, Feb 17 2013: (Start)
a(n) = sum(k=0, n, C(3*k+l,k)*C(3*(n-k)-l,n-k)) for every real number l.
a(n) = sum(k=0, n, 2^(n-k)*C(3n+1,k)).
a(n) = sum(k=0, n, 3^(n-k)*C(2n+k,k)).  (End)
From Akalu Tefera, Sean Meehan, Michael Weselcouch, and Aklilu Zeleke, May 11 2013: (Start)
a(n) = sum(k=0, 2n, (-3)^k*C(3n - k, n)).
a(n) = sum(k=0, 2n, (-4)^k*C(3n + 1, 2n - k)).
a(n) = sum(k=0, n, 3^k*C(3n - k, 2n)).
a(n) = sum(k=0, n, 2^k*C(3n + 1, n - k)).  (End)
a(n) = C(3*n+1,n)*Hyper2F1(1,-n,2*n+2,-2). - Peter Luschny, May 19 2015
a(n) = [x^n] 1/((1-3*x) * (1-x)^(2*n+1)). - Seiichi Manyama, Aug 03 2025
a(n) = Sum_{k=0..n} 3^k * (-2)^(n-k) * binomial(3*n+1,k) * binomial(3*n-k,n-k). - Seiichi Manyama, Aug 07 2025

A183160 a(n) = Sum_{k=0..n} C(n+k,n-k)C(2n-k,k).

Original entry on oeis.org

1, 2, 11, 62, 367, 2232, 13820, 86662, 548591, 3498146, 22436251, 144583496, 935394436, 6071718512, 39523955552, 257913792342, 1686627623151, 11050540084902, 72522925038257, 476669316338542, 3137209052543927, 20672732229560032, 136374124374593072, 900541325129687272

Offset: 0

Paul D. Hanna, Dec 27 2010

nonn

			G.f.: A(x) = 1 + 2*x + 11*x^2 + 62*x^3 + 367*x^4 + 2232*x^5 +...
A(x)^(1/2) = 1 + x + 5*x^2 + 26*x^3 + 145*x^4 + 841*x^5 + 5006*x^6 +...+ A183161(n)*x^n +...
Given triangle A085478(n,k) = C(n+k,n-k), which begins:
  1;
  1,  1;
  1,  3,  1;
  1,  6,  5,  1;
  1, 10, 15,  7, 1;
  1, 15, 35, 28, 9, 1; ...
ILLUSTRATE formula a(n) = Sum_{k=0..n} A085478(n,k)*A085478(n,n-k):
a(2) = 11 = 1*1 + 3*3 + 1*1;
a(3) = 62 = 1*1 + 6*5 + 5*6 + 1*1;
a(4) = 367 = 1*1 + 10*7 + 15*15 + 7*10 + 1*1;
a(5) = 2232 = 1*1 + 15*9 + 35*28 + 28*35 + 9*15 + 1*1; ...

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A001764, A085478, A183161, A199033, A218622.
Cf. A026641, A147855, A371753.
Cf. A005809, A006256, A160906, A226751.
Cf. A171822.

[(&+[Binomial(n+k, 2*k)*Binomial(2*n-k, k): k in [0..n]]): n in [0..25]]; // G. C. Greubel, Feb 22 2021

Table[Sum[Binomial[n+k,n-k]Binomial[2n-k,k],{k,0,n}],{n,0,20}] (* Harvey P. Dale, Jul 19 2011 *)
Table[HypergeometricPFQ[{-n, -n, 1/2 -n, n+1}, {1/2, 1, -2*n}, 1], {n, 0, 25}] (* G. C. Greubel, Feb 22 2021 *)

{a(n)=sum(k=0,n,binomial(n+k,n-k)*binomial(2*n-k,k))}

{a(n)=local(G=1); for(i=0, n, G=1+x*G^3+O(x^(n+1))); polcoeff(1/(1-2*x*G^2-3*x^2*G^4), n)} \\ Paul D. Hanna, Nov 03 2012

{a(n)=local(G=1); for(i=0, n, G=1+x*G^3+O(x^(n+1))); polcoeff(1/(1+3*x*G-5*x*G^2), n)} \\ Paul D. Hanna, Jun 16 2013
for(n=0, 30, print1(a(n), ", "))

a = lambda n: binomial(3*n+1,n)*hypergeometric([1,-n],[2*n+2],2)
[simplify(a(n)) for n in range(26)] # Peter Luschny, May 19 2015

a(n) = Sum_{k=0..n} A085478(n,k)*A085478(n,n-k).
Self-convolution of A183161 (an integer sequence):
a(n) = Sum_{k=0..n} A183161(k)*A183161(n-k).
a(n) = Sum_{k=0..n} binomial(2*n+k,k) * cos((n+k)*Pi). - Arkadiusz Wesolowski, Apr 02 2012
Recurrence: 320*n*(2*n-1)*a(n) = 8*(346*n^2 + 79*n - 327)*a(n-1) + 6*(1688*n^2-6241*n+5981)*a(n-2) + 261*(3*n-7)*(3*n-5)*a(n-3). - Vaclav Kotesovec, Oct 20 2012
a(n) ~ 3^(3*n+3/2)/(2^(2*n+3)*sqrt(Pi*n)). - Vaclav Kotesovec, Oct 20 2012
...
G.f.: A(x) = 1/(1 - 2*x*G(x)^2 - 3*x^2*G(x)^4), where G(x) = 1 + x*G(x)^3 = g.f. of A001764. - Paul D. Hanna, Nov 03 2012
G.f.: A(x) = 1 + x*d/dx { log( G(x)^5/(1+x*G(x)^2) )/2 }, where G(x) = 1 + x*G(x)^3 = g.f. of A001764. - Paul D. Hanna, Nov 04 2012
G.f.: A(x) = 1/(1 + 3*x*G(x) - 5*x*G(x)^2), where G(x) = 1 + x*G(x)^3 = g.f. of A001764. - Paul D. Hanna, Jun 16 2013
a(n) = C(3*n+1,n)*Hyper2F1([1,-n],[2*n+2],2). - Peter Luschny, May 19 2015
a(n) = [x^n] 1/((1 - x^2)*(1 - x)^(2*n)). - Ilya Gutkovskiy, Oct 25 2017
From G. C. Greubel, Feb 22 2021: (Start)
a(n) = Sum_{k=0..n} A171822(n, k).
a(n) = Hypergeometric 4F3([-n, -n, 1/2 -n, n+1], [1/2, 1, -2*n], 1). (End)
a(n) = Sum_{k=0..floor(n/2)} binomial(3*n-2*k-1,n-2*k). - Seiichi Manyama, Apr 05 2024
a(n) = Sum_{k=0..n} (-2)^(n-k) * binomial(3*n+1,k). - Seiichi Manyama, Aug 03 2025
From Seiichi Manyama, Aug 14 2025: (Start)
a(n) = Sum_{k=0..n} (-1)^k * 2^(n-k) * binomial(3*n+1,k) * binomial(3*n-k,n-k).
G.f.: g^2/((-1+2*g) * (3-2*g)) where g = 1+x*g^3 is the g.f. of A001764. (End)
G.f.: B(x)^2/(1 + 4*(B(x)-1)/3), where B(x) is the g.f. of A005809. - Seiichi Manyama, Aug 15 2025

A004355 Binomial coefficient C(6n,n).

Original entry on oeis.org

1, 6, 66, 816, 10626, 142506, 1947792, 26978328, 377348994, 5317936260, 75394027566, 1074082795968, 15363284301456, 220495674290430, 3173734438530120, 45795673964460816, 662252084388541314

Offset: 0

N. J. A. Sloane

a(n) is asymptotic to c*(46656/3125)^n/sqrt(n), with c = sqrt(3/(5*Pi)) = 0.437019372236831628217354... - Benoit Cloitre, Jan 23 2008

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.

T. D. Noe, Table of n, a(n) for n = 0..100
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

binomial(k*n,n): A000984 (k = 2), A005809 (k = 3), A005810 (k = 4), A001449 (k = 5), A004368 (k = 7), A004381 (k = 8), A169958 - A169961 (k = 9 thru 12).

Cf. A002295

[Binomial(6*n,n): n in [0..100]]; // Vincenzo Librandi, Apr 13 2011

Table[Binomial[6 n, n], {n, 0, 16}] (* Michael De Vlieger, Oct 05 2015 *)

B(x):=sum(binomial(6*n,n-1)/n*x^n,n,1,30);
taylor(x*diff(B(x),x)/B(x),x,0,10); /* Vladimir Kruchinin, Oct 05 2015 */

a(n) = binomial(6*n,n) \\ Altug Alkan, Oct 05 2015

a(n) = C(6*n-1,n-1)*C(36*n^2,2)/(3*n*C(6*n+1,3)), n>0. - Gary Detlefs, Jan 02 2014
G.f.: A(x) = x*B'(x)/B(x), where B(x)+1 is g.f. of A002295. - Vladimir Kruchinin, Oct 05 2015
a(n) = GegenbauerC(n, -3*n, -1). - Peter Luschny, May 07 2016
From Ilya Gutkovskiy, Jan 16 2017: (Start)
O.g.f.: 5F4(1/6,1/3,1/2,2/3,5/6; 1/5,2/5,3/5,4/5; 46656*x/3125).
E.g.f.: 5F5(1/6,1/3,1/2,2/3,5/6; 1/5,2/5,3/5,4/5,1; 46656*x/3125). (End)
RHS of identities Sum_{k = 0..n} binomial(3*n, k)*binomial(3*n, n-k) =
Sum_{k = 0..2*n} (-1)^(n+k)*binomial(6*n, k)*binomial(6*n, 2*n-k) = binomial(6*n,n). - Peter Bala, Oct 07 2021
From Peter Bala, Feb 20 2022: (Start)
5*n*(5*n-1)*(5*n-2)*(5*n-3)*(5*n-4)*a(n) = 6*(6*n-1)*(6*n-2)*(6*n-3)(6*n-4)*(6*n-5)*a(n-1).
The o.g.f. A(x) is algebraic: (1 - A(x))*(1 + 5*A(x))^5 +  (6^6)*x*A(x)^6 = 0.
Sum_{n >= 1} a(n)*( x*(5*x + 6)^5/(6^6*(1 + x)^6) )^n = x. (End)

A224274 a(n) = binomial(4*n,n)/4.

Original entry on oeis.org

1, 7, 55, 455, 3876, 33649, 296010, 2629575, 23535820, 211915132, 1917334783, 17417133617, 158753389900, 1451182990950, 13298522298180, 122131734269895, 1123787895356412, 10358022441395860, 95615237915961100, 883829035553043580, 8179808679272664720, 75788358475481302185

Offset: 1

Gary Detlefs, Apr 02 2013

In general, binomial(k*n,n)/k = binomial(k*n-1,n-1).
Sequences in the OEIS related to this identity are:
. C(2n,n) = A000984, C(2n,n)/2 = A001700;
. C(3n,n) = A005809, C(3n,n)/3 = A025174;
. C(4n,n) = A005810, C(4n,n)/4 = a(n);
. C(5n,n) = A001449, C(5n,n)/5 = A163456;
. C(6n,n) = A004355, C(6n,n)/6 is not in the OEIS.
Conjecture: a(n) == 1 (mod n^3) iff n is an odd prime.
It is known that a(p) == 1(mod p^3) for prime p >= 3. See Mestrovic, Section 3. - Peter Bala, Oct 09 2015

			For n=2, binomial(4*n,n) = binomial(8,2) = 8*7/2 = 28, so a(2) = 28/4 = 7. - _Michael B. Porter_, Jul 12 2016

G. C. Greubel, Table of n, a(n) for n = 1..1000
Dmitry Kruchinin and Vladimir Kruchinin, A Generating Function for the Diagonal T_{2n,n} in Triangles, Journal of Integer Sequence, Vol. 18 (2015), article 15.4.6.
Romeo Meštrović, Lucas’ theorem: its generalizations, extensions and applications (1878-2014), arXiv:1409.3820v1 [math.NT], 2014.
N. J. Wildberger and Dean Rubine, A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode, Amer. Math. Monthly (2025). See section 12.

Cf. A001700, A001764, A025174, A163456, A002293, A069271, A004331, A005810, A052203, A257633, A262977, A227726.

[Binomial(4*n,n) div 4: n in [1..25]]; // Vincenzo Librandi, Jun 03 2015

Maple
```
seq(binomial(4*n,n)/4, n=1..17);
```

Table[Binomial[4 n, n]/4, {n, 30}] (* Vincenzo Librandi, Jun 03 2015 *)

a(n) = binomial(4*n,n)/4; /* Joerg Arndt, Apr 02 2013 */

a(n) = binomial(4*n,n)/4 = A005810(n)/4.
a(n) = binomial(4*n-1,n-1).
G.f.: A(x) = B'(x)/B(x), where B(x) = 1 + x*B(x)^4 is g.f. of A002293. - Vladimir Kruchinin, Aug 13 2015
From Peter Bala, Oct 08 2015: (Start)
a(n) = 1/2*[x^n] (C(x)^2)^n, where C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the o.g.f. for the Catalan numbers A000108. Cf. A163456.
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 4*x^2 + 22*x^3 + ... is the o.g.f. for A002293.
exp( 2*Sum_{n >= 1} a(n)*x^n/n ) = 1 + 2*x + 9*x^2 + 52*x^3 + ... is the o.g.f. for A069271. (End)
From Peter Bala, Nov 04 2015: (Start)
With an offset of 1, the o.g.f. equals f(x)*g(x)^3, where f(x) is the o.g.f. for A005810 and g(x) is the o.g.f. for A002293. More generally, f(x)*g(x)^k is the o.g.f. for the sequence binomial(4*n + k,n). Cf. A262977 (k = -1), A005810 (k = 0), A052203 (k = 1), A257633 (k = 2) and A004331 (k = 4). (End)
a(n) = 1/5*[x^n] (1 + x)/(1 - x)^(3*n + 1) = 1/5*[x^n]( 1/C(-x) )^(5*n), where C(x) = (1 - sqrt(1 - 4*x))/(2*x) is the o.g.f. for the Catalan numbers A000108. Cf. A227726. - Peter Bala, Jul 12 2016
a(n) ~ 2^(8*n-3/2)*3^(-3*n-1/2)*n^(-1/2)/sqrt(Pi). - Ilya Gutkovskiy, Jul 12 2016
O.g.f.: A(x) = f(x)/(1 - 3*f(x)), where f(x) = series reversion (x/(1 + x)^4) = x + 4*x^2 + 22*x^3 + 140*x^4 + 969*x^5 + ... is the o.g.f. of A002293 with the initial term omitted. Cf. A025174. - Peter Bala, Feb 03 2022
Right-hand side of the identities (1/3)*Sum_{k = 0..n} (-1)^(n+k)*C(x*n,n-k)*C((x+3)*n+k-1,k) = C(4*n,n)/4 and (1/4)*Sum_{k = 0..n} (-1)^k*C(x*n,n-k)*C((x-4)*n+k-1,k) = C(4*n,n)/4, both valid for n >= 1 and x arbitrary. - Peter Bala, Feb 28 2022
Right-hand side of the identity (1/3)*Sum_{k = 0..2*n} (-1)^k*binomial(5*n-k-1,2*n-k)*binomial(3*n+k-1,k) = binomial(4*n,n)/4. - Peter Bala, Mar 09 2022
a(n) = [x^n] G(x)^n, where G(x) = 1 + x + 3*x^2 + 12*x^3 + 55*x^4 + 273*x^5 + ... is the g.f. of A001764. - Peter Bala, Oct 17 2024

A004319 a(n) = binomial(3*n, n - 1).

Original entry on oeis.org

1, 6, 36, 220, 1365, 8568, 54264, 346104, 2220075, 14307150, 92561040, 600805296, 3910797436, 25518731280, 166871334960, 1093260079344, 7174519270695, 47153358767970, 310325523515700, 2044802197953900, 13488561475572645, 89067326568860640, 588671286046028640

Offset: 1

N. J. A. Sloane

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.

Seiichi Manyama, Table of n, a(n) for n = 1..1000
Milan Janjic, Two Enumerative Functions.
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Emanuele Munarini, Shifting Property for Riordan, Sheffer and Connection Constants Matrices, Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.2.
Franck Ramaharo, Statistics on some classes of knot shadows, arXiv:1802.07701 [math.CO], 2018.

Cf. A045721 (k=1), A025174 (k=2), A236194 (k=4), A013698 (k=5), A165817 (k=-1), A117671 (k=-2).

Cf. A000139, A001764, A005809, A006013, A236194, A001791, A004331, A004343, A004356, A004369, A004382.

A004319 := proc(n)
binomial(3*n,n-1);
end proc: # R. J. Mathar, Aug 10 2015

Table[Binomial[3n, n - 1], {n, 20}] (* Harvey P. Dale, Sep 21 2011 *)

a(n):=sum((binomial(3*i-1,2*i-1)*binomial(3*n-3*i-3,2*n-2*i-2))/(2*n-2*i-1),i,1,n-1)/2; /* Vladimir Kruchinin, May 15 2013 */

vector(30, n, binomial(3*n, n-1)) \\ Altug Alkan, Nov 04 2015

G.f.: (g-1)/(1-3*z*g^2), where g = g(z) is given by g = 1 + z*g^3, g(0) = 1, i.e. (in Maple notation), g := 2*sin(arcsin(3*sqrt(3*z)/2)/3)/sqrt(3*z). - Emeric Deutsch, May 22 2003
a(n) = Sum_{i=0..n-1} binomial(i+2*n, i). - Ralf Stephan, Jun 03 2005
D-finite with recurrence -2*(2*n+1)*(n-1)*a(n) + 3*(3*n-1)*(3*n-2)*a(n-1) = 0. - R. J. Mathar, Feb 05 2013
a(n) = (1/2) * Sum_{i=1..n-1} binomial(3*i - 1, 2*i - 1)*binomial(3*n - 3*i - 3, 2*n - 2*i - 2)/(2*n - 2*i - 1). - Vladimir Kruchinin, May 15 2013
G.f.: x*hypergeom2F1(5/3, 4/3; 5/2; 27x/4). - R. J. Mathar, Aug 10 2015
a(n) = n*A001764(n). - R. J. Mathar, Aug 10 2015
From Peter Bala, Nov 04 2015: (Start)
With offset 0, the o.g.f. equals f(x)*g(x)^3, where f(x) is the o.g.f. for A005809 and g(x) is the o.g.f. for A001764. More generally, f(x)*g(x)^k is the o.g.f. for the sequence binomial(3*n + k, n). See the cross-references. (End)
G.f.: cos(t)/(2*sqrt(1 - (27*x)/4)) - sin(t)/(sqrt(3)*sqrt(x)), where t = arcsin((sqrt(27*x))/2)/3. - Vladimir Kruchinin, May 13 2016
a(n) = [x^(2*n+1)] 1/(1 - x)^n. - Ilya Gutkovskiy, Oct 10 2017
a(n) = binomial(n+1, 2) * A000139(n). - F. Chapoton, Feb 23 2024
a(n+1) = Sum_{k = 0..n} (-1)^(n+k)*binomial(4*n+4, k)*binomial(2*n-k, n-k). - Peter Bala, Sep 04 2025

A188678 Alternate partial sums of binomial(3n,n)/(2n+1).

Original entry on oeis.org

1, 0, 3, 9, 46, 227, 1201, 6551, 36712, 209963, 1220752, 7193888, 42873220, 257957352, 1564809168, 9559946496, 58768808463, 363261736872, 2256369305793, 14076552984507, 88163556913188, 554148894304557, 3494365949734563

Offset: 0

Emanuele Munarini, Apr 08 2011

Seiichi Manyama, Table of n, a(n) for n = 0..1000 (terms 0..100 from Vincenzo Librandi)

Cf. A005809, A001764, A188676, A104859, A188679, A188680, A188681, A188682, A188683, A188684, A188685, A188686, A188687.

Table[Sum[Binomial[3k,k](-1)^(n-k)/(2k+1),{k,0,n}],{n,0,20}]

makelist(sum(binomial(3*k,k)*(-1)^(n-k)/(2*k+1),k,0,n),n,0,20);

a(n) = Sum_{k=0..n} binomial(3*k,k)*(-1)^(n-k)/(2*k+1).
Recurrence: 2*(2*n^2+9*n+10)*a(n+2)-(23*n^2+63*n+40)*a(n+1)-3*(9*n^2+27*n+20)*a(n)=0.
G.f.: 2*sin((1/3)*arcsin(3*sqrt(3*x)/2))/((1+x)*sqrt(3*x)).
a(n) ~ 3^(3*n+3+1/2)/(31*sqrt(Pi)*n^(3/2)*2^(2*n+2)). - Vaclav Kotesovec, Aug 06 2013
G.f. A(x) satisfies: A(x) = 1 / (1 + x) + x * (1 + x)^2 * A(x)^3. - Ilya Gutkovskiy, Jul 25 2021

A188662 Binomial coefficients: a(n) = binomial(3*n,n)^2.

Original entry on oeis.org

1, 9, 225, 7056, 245025, 9018009, 344622096, 13521038400, 540917591841, 21966328580625, 902702926350225, 37456461988358400, 1566697064677290000, 65973795093338597136, 2794203818390077646400, 118933541228935777741056, 5084343623375056062840609

Offset: 0

Emanuele Munarini, Apr 07 2011

Even-order terms in the diagonal of rational function 1/(1 - (x^2 + y^2 + z^2 - x*y - y*z - x*z)). - Gheorghe Coserea, Aug 09 2018

Seiichi Manyama, Table of n, a(n) for n = 0..604

Cf. A005809, A000897, A002894, A002897, A006480, A008977, A186420.

[Binomial(3*n,n)^2: n in [0..100]]; // Vincenzo Librandi, Apr 08 2011

Mathematica
```
Table[Binomial[3 n, n]^2, {n, 0, 16}]
```
Maxima
```
makelist(binomial(3*n,n)^2,n,0,16);
```

a(n) = binomial(3*n,n)^2; \\ Michel Marcus, Nov 01 2016

from math import comb
def A188662(n): return comb(3*n,n)**2 # Chai Wah Wu, Mar 15 2023

a(n) = A005809(n)^2.
a(n) = binomial(3*n,n)^2 = ( [x^n](1 + x)^(3*n) )^2 = [x^n](F(x)^(9*n)), where F(x) = 1 + x + 4*x^2 + 49*x^3 + 795*x^4 + 15180*x^5 + 320422*x^6 + ... appears to have integer coefficients. For similar results see A000897, A002894, A002897, A006480, A008977 and A186420. - Peter Bala, Jul 12 2016
a(n) ~ 3^(6*n+1)*4^(-2*n-1)/(Pi*n). - Ilya Gutkovskiy, Jul 13 2016
a(n) = Sum_{k=0..n} binomial(n, k)^2*binomial(3*n+k, 2*n). - Seiichi Manyama, Jan 09 2017

A113424 a(n) = (6n)!/((3n)!(2n)!*n!).

Original entry on oeis.org

1, 60, 13860, 4084080, 1338557220, 465817912560, 168470811709200, 62588625639883200, 23717177328413240100, 9124964373613212524400, 3553261127084984957001360, 1397224499394244497967972800, 553883078634868423069470550800, 221068174083308549543680044926400

Offset: 0

Michael Somos, Oct 31 2005

Appears in Ramanujan's theory of elliptic functions of signature 6.
The family of elliptic curves "x=2*H=p^2+q^2-q^3, 0Bradley Klee, Feb 25 2018
The power series with coefficients a(n) * n! plays a central role in the Faber-Zagier relations on the moduli space of algebraic curves; see Pandharipande and Pixton, Section 0.2. - Harry Richman, Aug 19 2024

			G.f. = 1 + 60*x + 13860*x^2 + 4084080*x^3 + 1338557220*x^4 + ... - _Michael Somos_, Dec 02 2018

G. C. Greubel, Table of n, a(n) for n = 0..250
J. Cremona, Elliptic Curves over Q, LMFDB 2017.
Alin Bostan, Armin Straub, and Sergey Yurkevich, On the representability of sequences as constant terms, arXiv:2212.10116 [math.NT], 2022.
H. J. Brothers, Pascal's Prism: Supplementary Material.
S. Hassani, J.-M. Maillard, and N. Zenine, On the diagonals of rational functions: the minimal number of variables (unabridged version), arXiv:2502.05543 [math-ph], 2025. See p. 23.
Bradley Klee, Geometric G.F. for Ramanujan Periods, seqfans mailing list, 2017.
Bradley Klee, On LMFDB period data, LMFDB-support mailing list, 2018.
Bradley Klee, Weierstrass Solution of Cubic Anharmonic Oscillation, Wolfram Demonstrations Project, 2018.
Romeo Mestrovic, Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011), arXiv:1111.3057 [math.NT], 2011.
R. Pandharipande and A. Pixton, Relations in the tautological ring of the moduli space of curves, arXiv:1301.4561 [math.AG], 2020.
S. Ramanujan, Modular Equations and Approximations to Pi, Quarterly Journal of Mathematics, XLV (1914), 350-372.
L. C. Shen, A note on Ramanujan's identities involving the hypergeometric function 2F1(1/6,5/6;1;z), The Ramanujan Journal, 30.2 (2013), 211-222.

a(n) = A347304(6*n)
Elliptic Integrals: A002894, A006480, A000897. Factors: A005809, A066802.
Cf. A188662.

List([0..15],n->Factorial(6*n)/(Factorial(3*n)*Factorial(2*n)*Factorial(n))); # Muniru A Asiru, Apr 08 2018

a[ n_] := SeriesCoefficient[ Hypergeometric2F1[ 1/6, 5/6, 1, 432 x], {x, 0, n}];
Table[Multinomial[n, 2 n, 3 n], {n, 0, 15}] (* Vladimir Reshetnikov, Oct 12 2016 *)
a[ n_] := Multinomial[n, 2 n, 3 n]; (* Michael Somos, Dec 02 2018 *)

{a(n) = if( n<0, 0, (6*n)! / ((3*n)! * (2*n)! * n!))};

G.f.: hypergeometric2F1(1/6, 5/6; 1; 432 * x).
a(n) ~ 432^n/(2*Pi*n). - Ilya Gutkovskiy, Oct 13 2016
a(n) = A005809(n)*A066802(n). - Bradley Klee, Feb 25 2018
0 = a(n)*(-267483013447680*a(n+2) +25577192448000*a(n+3) -204669037440*a(n+4) +372142500*a(n+5)) +a(n+1)*(+408751349760*a(n+2) -57870650880*a(n+3) +546809652*a(n+4) -1088188*a(n+5)) +a(n+2)*(-17884800*a(n+2) +21466920*a(n+3) - 295844*a(n+4) +693*a(n+5)) for all n in Z. - Michael Somos, May 16 2018
From Peter Bala, Feb 28 2020: (Start)
a(n) = C(6*n,2*n)*C(4*n,n).
a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers n and k (apply Mestrovic, equation 39).
(-1)^n*a(n) = [x^(2*n)*y^(2*n)] ( (1 + x + y)*(1 - x + y) )^(4*n).
a(n) = [x^n] ( F(x) )^(60*n), where F(x) = 1 + x + 56*x^2 + 7355*x^3 + 1290319*x^4 + 264117464*x^5 + 59508459679*x^6 + ... appears to have integer coefficients. We conjecture that for k >= 1 the sequence defined by b_k(n) := [x^n] F(x)^(k*n) satisfies the above supercongruences for primes p >= 7. (End)
From Peter Bala, Mar 20 2022: (Start)
Right-hand side of the following identities valid for n >= 1:
Sum_{k = 0..2*n} 4*n*(4*n+k-1)!/(k!*n!*(3*n)!) = (6*n)!/((3*n)!*(2*n)!*n!);
Sum_{k = 0..3*n} 3*n*(3*n+k-1)!/(k!*n!*(2*n)!) = (6*n)!/((3*n)!(2*n)!*n!).
Cf. A001451. (End)
From Peter Bala, Feb 26 2023: (Start)
a(n) = (4^n/n!^2) * Product_{k = n..3*n-1} 2*k + 1.
a(n) = (12^n/n!^2) * Product_{k = 0..n-1} (6*k + 1)*(6*k + 5). (End)
a(n) = 12*(6*n - 1)*(6*n - 5)*a(n-1)/n^2. - Neven Sajko, Jul 19 2023
From Karol A. Penson, Dec 26 2023: (Start)
a(n) = Integral_{x=0..432} x^n*W(x) dx, n>=0, where W(x) = sqrt(18)*MeijerG([[], [0, 0]], [[-1/6, -5/6], []], x/432)/(1296*Pi), where MeijerG is the Meijer G - function.
Apparently, W(x) cannot be represented by any other function. W(x) is positive on x = [0, 432], it diverges at x=0, and monotonically decreases for x>0. It appears that at x=432, W(x) tends to a constant value close to 0.000368414. This integral representation as the n-th power moment of the positive function W(x) on the interval [0, 432] is unique, as W(x) is the solution of the Hausdorff moment problem. (End)
W(x) can be represented in terms of two 2F1 hypergeometric functions, W(x) = hypergeom([1/6, 1/6], [1/3], x/432)/(6*sqrt(Pi)*Gamma(2/3)*Gamma(5/6)*x^(5/6)) - Gamma(2/3)*Gamma(5/6)*sqrt(3)*hypergeom([5/6, 5/6], [5/3], x/432)/(1152*Pi^(5/2)*x^(1/6)), x on (0, 432). - Karol A. Penson, May 16 2025

A013698 a(n) = binomial(3*n+2, n-1).

Original entry on oeis.org

1, 8, 55, 364, 2380, 15504, 100947, 657800, 4292145, 28048800, 183579396, 1203322288, 7898654920, 51915526432, 341643774795, 2250829575120, 14844575908435, 97997533741800, 647520696018735, 4282083008118300, 28339603908273840, 187692294101632320, 1243918491347262900

Offset: 1

Joachim.Rosenthal(AT)nd.edu (Joachim Rosenthal) and Emeric Deutsch

Degree of variety K_{2,n}^1. Also number of double-rises (or odd-level peaks) in all generalized {(1,2),(1,-1)}-Dyck paths of length 3(n+1).
Number of dissections of a convex (2n+2)-gon by n-2 noncrossing diagonals into (2j+2)-gons, 1<=j<=n-1.
a(n) is the number of lattice paths from (0,0) to (3n+1,n-1) avoiding two consecutive up-steps. - Shanzhen Gao, Apr 20 2010

Robert Israel, Table of n, a(n) for n = 1..1000
M. S. Ravi, Joachim Rosenthal, and Xiaochang Wang, Dynamic Pole Assignment and Schubert Calculus, SIAM J. Control Optimization, 34 (1996), 813-832, esp. p. 825.
Daniel W. Stasiuk, An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads, Master's Thesis, University of Saskatchewan-Saskatoon (2018).

Cf. A013699 (q=2), A013700 (q=3), A013701 (q=4), A013702 (q=5).

A column of triangle A102537. Cf. A001764, A004319, A005809, A006013, A025174, A045721, A117671, A165817, A236194.

List([1..25], n-> Binomial(3*n+2, n-1)) # G. C. Greubel, Mar 21 2019

[Binomial(3*n+2, n-1): n in [1..25]]; // Vincenzo Librandi, Aug 10 2015

seq(binomial(3*n+2,n-1), n=0..30); # Robert Israel, Aug 09 2015

Table[Binomial[3*n+2, n-1], {n, 25}] (* Arkadiusz Wesolowski, Apr 02 2012 *)

first(m)=vector(m,n,binomial(3*n+2, n-1)); /* Anders Hellström, Aug 09 2015 */

[binomial(3*n+2, n-1) for n in (1..25)] # G. C. Greubel, Mar 21 2019

G.f.: g/((g-1)^3*(3*g-1)) where g*(1-g)^2 = x. - Mark van Hoeij, Nov 09 2011
a(n) = Sum_{k=0..n-1} binomial(2*n+k+2,k). - Arkadiusz Wesolowski, Apr 02 2012
D-finite with recurrence 2*(2*n+3)*(n+1)*a(n) - n*(67*n+34)*a(n-1) + 30*(3*n-1)*(3*n-2)*a(n-2) = 0. - R. J. Mathar, Feb 05 2013
a(n+1) = (3*n+5)*(3*n+4)*(3*n+3)*a(n)/((2*n+5)*(2*n+4)*n). - Robert Israel, Aug 09 2015
With offset 0, the o.g.f. equals f(x)*g(x)^5, where f(x) is the o.g.f. for A005809 and g(x) is the o.g.f. for A001764. More generally, f(x)*g(x)^k is the o.g.f. for the sequence binomial(3*n + k,n). Cf. A045721 (k = 1), A025174 (k = 2), A004319 (k = 3), A236194 (k = 4), A165817 (k = -1), A117671 (k = -2). - Peter Bala, Nov 04 2015
a(n) ~ 3^(3*n+5/2) / (4^(n+2) * sqrt(Pi*n)). - Amiram Eldar, Sep 05 2025

A004780 Binary expansion contains 2 adjacent 1's.

Original entry on oeis.org

3, 6, 7, 11, 12, 13, 14, 15, 19, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 35, 38, 39, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 67, 70, 71, 75, 76, 77, 78, 79, 83, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100

Offset: 1

N. J. A. Sloane

Complement of A003714. It appears that n is in the sequence if and only if C(3n,n) is even. - Benoit Cloitre, Mar 09 2003
Since the binary representation of these numbers contains two adjacent 1's, so for these values of n, we will have (n XOR 2n XOR 3n) != 0, and thus a two player Nim game with three heaps of (n, 2n, 3n) stones will be a winning configuration for the first player. - V. Raman, Sep 17 2012
A048728(a(n)) > 0. - Reinhard Zumkeller, May 13 2014
The set of numbers x such that Or(x,3*x) <> 3*x. - Gary Detlefs, Jun 04 2024

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for sequences related to binary expansion of n

Cf. A005809, A048728, A242408.
Complement: A003714.
Subsequences (apart from any initial zero-term): A001196, A004755, A004767, A033428, A277335.

a004780 n = a004780_list !! (n-1)
a004780_list = filter ((> 1) . a048728) [1..]
-- Reinhard Zumkeller, May 13 2014

q:= n-> verify([1$2], Bits[Split](n), 'sublist'):
select(q, [$0..200])[];  # Alois P. Heinz, Oct 22 2021

is(n)=bitand(n,n+n)>0 \\ Charles R Greathouse IV, Sep 19 2012

from itertools import count, islice
def A004780_gen(startvalue=1): # generator of terms >= startvalue
    return filter(lambda n:n&(n<<1), count(max(startvalue,1)))
A004780_list = list(islice(A004780_gen(),30)) # Chai Wah Wu, Jul 13 2022

a(n) ~ n. - Charles R Greathouse IV, Sep 19 2012

Offset corrected by Reinhard Zumkeller, Jul 28 2010

cp's OEIS Frontend

A006256 a(n) = Sum_{k=0..n} binomial(3*k,k)*binomial(3*n-3*k,n-k).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Sage

Formula

A183160 a(n) = Sum_{k=0..n} C(n+k,n-k)*C(2*n-k,k).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

PARI

Sage

Formula

A004355 Binomial coefficient C(6n,n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

Maxima

PARI

Formula

A224274 a(n) = binomial(4*n,n)/4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A004319 a(n) = binomial(3*n, n - 1).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

Formula

A188678 Alternate partial sums of binomial(3*n,n)/(2*n+1).

Views

Author

Keywords

Links

Crossrefs

Programs

A006256 a(n) = Sum_{k=0..n} binomial(3k,k)binomial(3n-3k,n-k).

A183160 a(n) = Sum_{k=0..n} C(n+k,n-k)C(2n-k,k).

A188678 Alternate partial sums of binomial(3n,n)/(2n+1).

A113424 a(n) = (6n)!/((3n)!(2n)!*n!).