A212073 -id:A212073 - cp's OEIS frontend

A233830 a(n) = 5binomial(6n+10,n)/(3*n+5).

1, 10, 105, 1170, 13640, 164502, 2036265, 25727800, 330482295, 4303216330, 56672074888, 753573733050, 10103474312100, 136435868978220, 1854009194816745, 25333847134998864, 347880174736462550, 4798137522234602700, 66441427922465470095, 923346006310186106010, 12873823246049001482400

Offset: 0

Tim Fulford, Dec 16 2013

nonn

Fuss-Catalan sequence is a(n,p,r) = r*binomial(np+r,n)/(np+r), this is the case p=6, r=10.

Vincenzo Librandi, Table of n, a(n) for n = 0..200
J-C. Aval, Multivariate Fuss-Catalan Numbers, arXiv:0711.0906v1, Discrete Math., 308 (2008), 4660-4669.
Thomas A. Dowling, Catalan Numbers Chapter 7
Wojciech Mlotkowski, Fuss-Catalan Numbers in Noncommutative Probability, Docum. Mathm. 15: 939-955.

Cf. A000108, A002295, A212071, A212072, A212073, A130564, A233743, A233827, A233829.

[5*Binomial(6*n+10, n)/(3*n+5): n in [0..30]];

Table[5 Binomial[6 n + 10, n]/(3 n + 5), {n, 0, 30}]

PARI
```
a(n) = 5*binomial(6*n+10,n)/(3*n+5);
```

{a(n)=local(B=1); for(i=0, n, B=(1+x*B^(3/5))^10+x*O(x^n)); polcoeff(B, n)}

G.f. satisfies: B(x) = {1 + x*B(x)^(p/r)}^r, here p=6, r=10.
From Ilya Gutkovskiy, Sep 14 2018: (Start)
E.g.f.: 6F6(5/3,11/6,2,13/6,7/3,5/2; 1,11/5,12/5,13/5,14/5,3; 46656*x/3125).
a(n) ~ 3^(6*n+19/2)*4^(3*n+5)/(sqrt(Pi)*5^(5*n+19/2)*n^(3/2)). (End)

A333096 a(n) = the n-th order Taylor polynomial (centered at 0) of c(x)^(4n) evaluated at x = 1, where c(x) = (1 - sqrt(1 - 4x))/(2*x) is the o.g.f. of the sequence of Catalan numbers A000108.

Original entry on oeis.org

1, 5, 53, 647, 8373, 111880, 1525511, 21093476, 294663349, 4148593604, 58770091928, 836722722951, 11961868391175, 171601856667701, 2469036254872996, 35615467194043147, 514888180699419829, 7458193213805231529, 108219144962546395364, 1572690742149983040857

Offset: 0

Peter Bala, Mar 15 2020

The sequence satisfies the Gauss congruences a(n*p^k) == a(n*p^(k-1)) ( mod p^k ) for all prime p and positive integers n and k.
We conjecture that the sequence satisfies the stronger supercongruences a(n*p^k) == a(n*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers n and k. Examples of these congruences are given below.
More generally, for each integer m, we conjecture that the sequence a_m(n) := the n-th order Taylor polynomial of c(x)^(m*n) evaluated at x = 1 satisfies the same supercongruences. For cases see A099837 (m = -2), A100219 (m = -1), A000012 (m = 0), A333093 (m = 1), A333094 (m = 2), A333095 (m = 3), A333097 (m = 5).

			n-th order Taylor polynomial of c(x)^(4*n):
  n = 0: c(x)^0 = 1 + O(x)
  n = 1: c(x)^4 = 1 + 4*x + O(x^2)
  n = 2: c(x)^8 = 1 + 8*x + 44*x^2 + O(x^3)
  n = 3: c(x)^12 = 1 + 12*x + 90*x^2 + 544*x^3 + O(x^4)
  n = 4: c(x)^16 = 1 + 16*x + 152*x^2 + 1120*x^3 + 7084*x^4 + O(x^5)
Setting x = 1 gives a(0) = 1, a(1) = 1 + 4 = 5, a(2) = 1 + 8 + 44 = 53, a(3) = 1 + 12 + 90 + 544 = 647 and a(4) = 1 + 16 + 152 + 1120 + 7084 = 8373.
The triangle of coefficients of the n-th order Taylor polynomial of c(x)^(4*n), n >= 0, in descending powers of x begins
                                         row sums
  n = 0 |    1                               1
  n = 1 |    4     1                         5
  n = 2 |   44     8     1                  53
  n = 3 |  544    90    12     1           647
  n = 4 | 7084  1120   152    16   1      8373
   ...
This is a Riordan array belonging to the Hitting time subgroup of the Riordan group.
Examples of congruences:
a(13) - a(1) = 171601856667701 - 5 = (2^4)*3*(7^2)*(13^3)*33208909 == 0 ( mod 13^3 ).
a(3*7) - a(3) = 333475516822140871773101 - 647 = 2*(3^2)*(7^3)* 54012879303877692221 == 0 ( mod 7^3 ).
a(5^2) - a(5) = 15187725485911657497382846255 - 111880 = (3^3)*(5^7)*29* 248279548173268475053 == 0 ( mod 5^6 ).

Cf. A000108, A212073, A333090 through A333097.

seq(add(4*n/(4*n+k)*binomial(4*n+2*k-1,k), k = 0..n), n = 1..25);
#alternative program
c:= x → (1/2)*(1-sqrt(1-4*x))/x:
G := (x,n) → series(c(x)^(4*n), x, 126):
seq(add(coeff(G(x, n), x, n-k), k = 0..n), n = 0..25);

Join[{1}, Table[4*Binomial[6*n-1, n] * HypergeometricPFQ[{1, -5*n, -n}, {1/2 - 3*n, 1 - 3*n}, 1/4]/5, {n, 1, 20}]] (* Vaclav Kotesovec, Mar 28 2020 *)

a(n) = Sum_{k = 0..n} 4*n/(4*n+k)*binomial(4*n+2*k-1, k) for n >= 1.
a(n) = [x^n] ( (1 + x)*c^4(x/(1 + x)) )^n.
O.g.f.: ( 1 + x*f'(x)/f(x) )/( 1 - x*f(x) ), where f(x) = 1 + 4*x + 30*x^2 + 280*x^3 + 2925*x^4 + ... = (1/x)*Revert( x/c^4(x) ) is the o.g.f. of A212073.
Row sums of the Riordan array ( 1 + x*f'(x)/f(x), f(x) ) belonging to the Hitting time subgroup of the Riordan group.
a(n) ~ 2^(6*n + 3) * 3^(6*n + 3/2) / (31 * sqrt(Pi*n) * 5^(5*n + 1/2)). - Vaclav Kotesovec, Mar 28 2020
a(n) = Sum_{k = 0..n} 4*n/(4*n+2*k)*binomial(4*n+2*k, k) for n >= 1. - Peter Bala, May 03 2024

A386379 a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/5)} a(5k) a(n-1-5*k).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 13, 21, 30, 40, 51, 114, 190, 280, 385, 506, 1150, 1950, 2925, 4095, 5481, 12586, 21576, 32736, 46376, 62832, 145299, 250971, 383838, 548340, 749398, 1741844, 3025308, 4654320, 6690585, 9203634, 21475146, 37456650, 57887550

Offset: 0

Seiichi Manyama, Jul 20 2025

nonn

Wikipedia, Fuss-Catalan number

Cf. A002295, A212071, A212072, A212073, A130564.

Cf. A047749, A118968, A124753, A386380.

apr(n, p, r) = r*binomial(n*p+r, n)/(n*p+r);
a(n) = apr(n\5, 6, n%5+1);

For k=0..4, a(5*n+k) = (k+1) * binomial(6*n+k+1,n)/(6*n+k+1).

G.f. A(x) satisfies A(x) = 1/(1 - x * Product_{k=0..4} A(w^k*x)), where w = exp(2*Pi*i/5).

A386392 a(n) = 4 * binomial(7n+4,n)/(7n+4).

Original entry on oeis.org

1, 4, 34, 368, 4495, 59052, 814506, 11633440, 170574723, 2552698720, 38832808586, 598724403680, 9335085772194, 146936230074004, 2331703871687400, 37263447339612480, 599206511767593099, 9688121925389895636, 157401957319775436400, 2568427016865897264000

Offset: 0

Seiichi Manyama, Jul 20 2025

nonn

Wikipedia, Fuss-Catalan number

Cf. A118971, A212073, A234463, A234507, A234527, A234870.

Cf. A002296, A386380.

apr(n, p, r) = r*binomial(n*p+r, n)/(n*p+r);
a(n) = apr(n, 7, 4);

a(n) = r * binomial(n*p+r,n)/(n*p+r), the Fuss-Catalan number with p=7 and r=4.
a(n) = A386380(6*n+3).
G.f. A(x) satisfies A(x) = (1 + x*A(x)^(p/r))^r, where p=7, r=4.
G.f.: B(x)^4, where B(x) is the g.f. of A002296.

cp's OEIS Frontend

A233830 a(n) = 5*binomial(6*n+10,n)/(3*n+5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A333096 a(n) = the n-th order Taylor polynomial (centered at 0) of c(x)^(4*n) evaluated at x = 1, where c(x) = (1 - sqrt(1 - 4*x))/(2*x) is the o.g.f. of the sequence of Catalan numbers A000108.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A386379 a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/5)} a(5*k) * a(n-1-5*k).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A386392 a(n) = 4 * binomial(7*n+4,n)/(7*n+4).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A233830 a(n) = 5binomial(6n+10,n)/(3*n+5).

A333096 a(n) = the n-th order Taylor polynomial (centered at 0) of c(x)^(4n) evaluated at x = 1, where c(x) = (1 - sqrt(1 - 4x))/(2*x) is the o.g.f. of the sequence of Catalan numbers A000108.

A386379 a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/5)} a(5k) a(n-1-5*k).

A386392 a(n) = 4 * binomial(7n+4,n)/(7n+4).