A007556 -id:A007556 - cp's OEIS frontend

A349314 G.f. A(x) satisfies: A(x) = (1 + x * A(x)^8) / (1 - x).

1, 2, 18, 274, 4930, 97346, 2039570, 44524818, 1001773058, 23065953794, 540886665618, 12872727013522, 310135678438978, 7549240857128258, 185381380643501970, 4586875745951650706, 114244031335228433922, 2862001783406012428802, 72067481493990612275474

Offset: 0

Ilya Gutkovskiy, Nov 14 2021

nonn

In general, for k > 1, Sum_{j=0..n} binomial(n + (k-1)*j,k*j) * binomial(k*j,j) / ((k-1)*j+1) ~ (1-r)^(1/(k-1) - 1/2) * sqrt(1 + (k-1)*r) / (sqrt(2*Pi*(k-1)) * k^(1/(k-1) + 1/2) * n^(3/2) * r^(n + 1/(k-1))), where r is the smallest real root of the equation (k-1)^(k-1) * (1-r)^k = k^k * r. - Vaclav Kotesovec, Nov 15 2021

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

Cf. A006318, A007556, A346626, A346650, A349310, A349311, A349312, A349313.

nmax = 18; A[] = 0; Do[A[x] = (1 + x A[x]^8)/(1 - x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n + 7 k, 8 k] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 18}]

a(n) = Sum_{k=0..n} binomial(n+7*k,8*k) * binomial(8*k,k) / (7*k+1).
a(n) = F([(1+n)/7, (2+n)/7, (3+n)/7, (4+n)/7, (5+n)/7, (6+n)/7, 1+n/7, -n], [2/7, 3/7, 4/7, 5/7, 6/7, 1, 8/7], -1), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 14 2021
a(n) ~ sqrt(1 + 7*r) / (2^(17/7) * sqrt(7*Pi) * (1-r)^(5/14) * n^(3/2) * r^(n + 1/7)), where r = 0.036466941615119756839260438459647497790132092200414533994... is the smallest real root of the equation 7^7 * (1-r)^8 = 8^8 * r. - Vaclav Kotesovec, Nov 15 2021

A251588 a(n) = 8^(n-6) * (n+1)^(n-8) * (16807n^6 + 143031n^5 + 525875n^4 + 1074745n^3 + 1294846n^2 + 876856n + 262144).

Original entry on oeis.org

1, 1, 10, 254, 11080, 700008, 58411696, 6082359760, 760774053888, 111229735731200, 18626295180427264, 3516652429787529216, 739238816214490808320, 171262175332556483854336, 43359709355122360320000000, 11911510903698787868252045312, 3529104034183977458725537447936, 1121766516051874786454563454976000

Offset: 0

Paul D. Hanna, Dec 06 2014

nonn

			E.g.f.: A(x) = 1 + x + 10*x^2/2! + 254*x^3/3! + 11080*x^4/4! + 700008*x^5/5! +...
such that A(x) = exp( 7*x*A(x) * G(x*A(x))^6 ) / G(x*A(x))^6
where G(x) = 1 + x*G(x)^8 is the g.f. of A007556:
G(x) = 1 + x + 8*x^2 + 92*x^3 + 1240*x^4 + 18278*x^5 + 285384*x^6 +...
RELATED SERIES.
Note that A(x) = F(x*A(x)) where F(x) = exp(8*x*G(x)^7)/G(x)^7,
F(x) = 1 + x + 8*x^2/2! + 176*x^3/3! + 6896*x^4/4! + 397888*x^5/5! +...
is the e.g.f. of A251578.

G. C. Greubel, Table of n, a(n) for n = 0..296

Cf. A251578, A007556.

Cf. Variants: A251583, A251584, A251585, A251586, A251587, A251589, A251590.

[8^(n - 6)*(n + 1)^(n - 8)*(16807*n^6 + 143031*n^5 + 525875*n^4 + 1074745*n^3 + 1294846*n^2 + 876856*n + 262144): n in [0..50]]; // G. C. Greubel, Nov 13 2017

Table[8^(n - 6)*(n + 1)^(n - 8)*(16807*n^6 + 143031*n^5 + 525875*n^4 + 1074745*n^3 + 1294846*n^2 + 876856*n + 262144), {n, 0, 50}] (* G. C. Greubel, Nov 13 2017 *)

{a(n) = 8^(n-6) * (n+1)^(n-8) * (16807*n^6 + 143031*n^5 + 525875*n^4 + 1074745*n^3 + 1294846*n^2 + 876856*n + 262144)}
for(n=0,20,print1(a(n),", "))

{a(n) = local(G=1,A=1); for(i=1,n, G=1+x*G^8 +x*O(x^n));
for(i=1,n, A = exp(8*x*A * subst(G^7,x,x*A) ) / subst(G^7,x,x*A) ); n!*polcoeff(A, n)}
for(n=0, 20, print1(a(n), ", "))

Let G(x) = 1 + x*G(x)^8 be the g.f. of A007556, then the e.g.f. A(x) of this sequence satisfies:
(1) A(x) = exp( 8*x*A(x) * G(x*A(x))^7 ) / G(x*A(x))^7.
(2) A(x) = F(x*A(x)) where F(x) = exp(8*x*G(x)^7)/G(x)^7 is the e.g.f. of A251578.
(3) a(n) = [x^n/n!] F(x)^(n+1)/(n+1) where F(x) is the e.g.f. of A251578.
E.g.f.: -LambertW(-8*x) * (8 + LambertW(-8*x))^7 / (x*8^8). - Vaclav Kotesovec, Dec 07 2014

A251698 a(n) = (6n+1) (7n+1)^(n-2) 8^n.

Original entry on oeis.org

1, 7, 832, 214016, 86118400, 47393538048, 33160072265728, 28180480000000000, 28194546272924860416, 32466269569728810844160, 42295727044150128912891904, 61505801717703291002224115712, 98762474157744880353280000000000, 173565347832317233669371533581090816, 331360760866451564310212841997955235840

Offset: 0

Paul D. Hanna, Dec 07 2014

nonn

			E.g.f.: A(x) = 1 + 7*x + 832*x^2/2! + 214016*x^3/3! + 86118400*x^4/4! + 47393538048*x^5/5! +...
such that A(x) = exp( 8*x*A(x)^7 * G(x*A(x)^7)^7 ) / G(x*A(x)^7),
where G(x) = 1 + x*G(x)^8 is the g.f. A007556:
G(x) = 1 + x + 8*x^2 + 92*x^3 + 1240*x^4 + 18278*x^5 + 285384*x^6 +...
Also, e.g.f. A(x) satisfies A(x) = F(x*A(x)^7) where
F(x) = 1 + 7*x + 146*x^2/2! + 5570*x^3/3! + 316376*x^4/4! + 24070168*x^5/5! +...
F(x) = exp( 8*x*G(x)^7 ) / G(x) is the e.g.f. of A251668.

G. C. Greubel, Table of n, a(n) for n = 0..240

Cf. A251668, A007556.

Cf. Variants: A127670, A251693, A251694, A251695, A251696, A251697, A251699, A251700.

[(6*n + 1)*(7*n + 1)^(n - 2)*8^n: n in [0..50]]; // G. C. Greubel, Nov 14 2017

Table[(6*n + 1)*(7*n + 1)^(n - 2)*8^n, {n, 0, 50}] (* G. C. Greubel, Nov 14 2017 *)

{a(n) = (6*n+1) * (7*n+1)^(n-2) * 8^n}
for(n=0,20,print1(a(n),", "))

{a(n)=local(G=1,A=1); for(i=0, n, G = 1 + x*G^8 +x*O(x^n));
A = ( serreverse( x*G^7 / exp(56*x*G^7) )/x )^(1/7); n!*polcoeff(A, n)}
for(n=0, 20, print1(a(n), ", "))

Let G(x) = 1 + x*G(x)^8 be the g.f. of A007556, then the e.g.f. A(x) of this sequence satisfies:
(1) A(x) = exp( 8*x*A(x)^7 * G(x*A(x)^7)^7 ) / G(x*A(x)^7).
(2) A(x) = F(x*A(x)^7) where F(x) = exp(8*x*G(x)^7)/G(x) is the e.g.f. of A251668.
(3) A(x) = ( Series_Reversion( x*G(x)^7 / exp(56*x*G(x)^7) )/x )^(1/7).
E.g.f.: (-LambertW(-56*x)/(56*x))^(1/7) * (1 + LambertW(-56*x)/56). - Vaclav Kotesovec, Dec 07 2014

A349335 G.f. A(x) satisfies A(x) = 1 + x * A(x)^8 / (1 - x).

Original entry on oeis.org

1, 1, 9, 109, 1541, 23823, 390135, 6651051, 116798643, 2098313686, 38382509118, 712447023590, 13385500614902, 254065657922154, 4864482597112186, 93840443376075810, 1822169236520766546, 35586928273002974487, 698572561837366684479, 13775697096997873764647

Offset: 0

Ilya Gutkovskiy, Nov 15 2021

nonn

In general, for m > 1, Sum_{k=0..n} binomial(n-1,k-1) * binomial(m*k,k) / ((m-1)*k+1) ~ (m-1)^(m/2 - 2) * (1 + m^m/(m-1)^(m-1))^(n + 1/2) / (sqrt(2*Pi) * m^((m-1)/2) * n^(3/2)). - Vaclav Kotesovec, Nov 15 2021

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

Cf. A002212, A307678, A349331, A349332, A349333, A349334.

Cf. A007556, A346650 (partial sums), A349364.

a:= n-> coeff(series(RootOf(1+x*A^8/(1-x)-A, A), x, n+1), x, n):
seq(a(n), n=0..19);  # Alois P. Heinz, Nov 15 2021

nmax = 19; A[] = 0; Do[A[x] = 1 + x A[x]^8/(1 - x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[Binomial[n - 1, k - 1] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 19}]

{a(n) = my(A=[1]); for(m=1, n, A=concat(A, 0);
A[#A] = 1 + sum(k=1, m-1, (polcoeff(Ser(A)^8, k)) )); A[n+1]}
for(n=0, 30, print1(a(n), ", ")) \\ Vaclav Kotesovec, Nov 23 2024, after Paul D. Hanna

a(n) = Sum_{k=0..n} binomial(n-1,k-1) * binomial(8*k,k) / (7*k+1).

a(n) ~ 17600759^(n + 1/2) / (2048 * sqrt(Pi) * n^(3/2) * 7^(7*n + 3/2)). - Vaclav Kotesovec, Nov 15 2021

A355262 Array of Fuss-Catalan numbers read by ascending antidiagonals, A(n, k) = binomial(kn + 1, k)/(kn + 1).

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 3, 5, 1, 0, 1, 1, 4, 12, 14, 1, 0, 1, 1, 5, 22, 55, 42, 1, 0, 1, 1, 6, 35, 140, 273, 132, 1, 0, 1, 1, 7, 51, 285, 969, 1428, 429, 1, 0, 1, 1, 8, 70, 506, 2530, 7084, 7752, 1430, 1, 0

Offset: 0

Peter Luschny, Jun 26 2022

An alternative definition is: the Fuss-Catalan sequences (A(n, k), k >= 0 ) are the main diagonals of the Fuss-Catalan triangles of order n - 1. See A355173 for the definition of a Fuss-Catalan triangle.

			Array A(n, k) begins:
[0] 1, 1, 0,   0,    0,     0,      0,       0,         0, ...  A019590
[1] 1, 1, 1,   1,    1,     1,      1,       1,         1, ...  A000012
[2] 1, 1, 2,   5,   14,    42,    132,     429,      1430, ...  A000108
[3] 1, 1, 3,  12,   55,   273,   1428,    7752,     43263, ...  A001764
[4] 1, 1, 4,  22,  140,   969,   7084,   53820,    420732, ...  A002293
[5] 1, 1, 5,  35,  285,  2530,  23751,  231880,   2330445, ...  A002294
[6] 1, 1, 6,  51,  506,  5481,  62832,  749398,   9203634, ...  A002295
[7] 1, 1, 7,  70,  819, 10472, 141778, 1997688,  28989675, ...  A002296
[8] 1, 1, 8,  92, 1240, 18278, 285384, 4638348,  77652024, ...  A007556
[9] 1, 1, 9, 117, 1785, 29799, 527085, 9706503, 184138713, ...  A062994

N. I. Fuss, Solutio quaestionis, quot modis polygonum n laterum in polygona m laterum, per diagonales resolvi queat, Nova Acta Academiae Scientiarum Imperialis Petropolitanae, vol.9 (1791), 243-251.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1990, (Eqs. 5.70, 7.66, and sec. 7.5, example 5).

Per Alexandersson, Frether Getachew Kebede, Samuel Asefa Fufa, and Dun Qiu, Pattern-Avoidance and Fuss-Catalan Numbers, J. Int. Seq. (2023) Vol. 26, Art. 23.4.2.
Joerg Arndt, Matters Computational (The Fxtbook), pp. 337-338.
Jean-Luc Baril, Mireille Bousquet-Mélou, Sergey Kirgizov, and Mehdi Naima, The ascent lattice on Dyck paths, arXiv:2409.15982 [math.CO], 2024. See p. 6.
Jean-Christophe Aval, Multivariate Fuss-Catalan Numbers, arXiv:0711.0906v1, Discrete Math., 308 (2008), 4660-4669.
Thomas A. Dowling, Catalan Numbers, Chapter 7.
D. E. Knuth, Convolution polynomials, arXiv:math/9207221 [math.CA]; Mathematica J. 2.1 (1992), no. 4, 67-78.
Donald Knuth's 20th Annual Christmas Tree Lecture, (3/2)-ary Trees, Stanford Online, Video 2014.
Wojciech Młotkowski, Fuss-Catalan Numbers in Noncommutative Probability, Docum. Math. 15:939-955, (2010).
Wikipedia, Fuss-Catalan number.

Cf. A091144 (main diagonal), A019590, A000012, A000108, A001764, A002293, A002294, A002295, A002296, A007556, A062994.
Variants: A062993, A070914.
Fuss-Catalan triangles: A123110 (order 0), A355173 (order 1), A355172 (order 2), A355174 (order 3).

A := (n, k) -> binomial(k*n + 1, k)/(k*n + 1):
for n from 0 to 9 do seq(A(n, k), k = 0..8) od;

(* See the Knuth references. In the christmas lecture Knuth has fun calculating the Fuss-Catalan development of Pi and i. *)
B[t_, n_] := Sum[Binomial[t k+1, k] z^k / (t k+1), {k, 0, n-1}] + O[z]^n
Table[CoefficientList[B[n, 9], z], {n, 0, 9}] // TableForm

A(n, k) = (1/k!) * Product_{j=1..k-1} (k*n + 1 - j).
A(n, k) = (binomial(k*n, k) + binomial(k*n, k-1)) / (k*n + 1).
Let B(t, z) = Sum_{k>=0} binomial(k*t + 1, k)*z^k / (k*t + 1), then
A(n, k) = [z^k] B(n, z).

A230390 5binomial(8n+10,n)/(4*n+5).

Original entry on oeis.org

1, 10, 125, 1760, 26650, 423752, 6978510, 117998400, 2036685765, 35738059500, 635627275767, 11433154297760, 207621482341000, 3801296492623560, 70092637731997100, 1300500163756675200, 24262157874835233000, 454847339247972377850, 8564398318045559667475

Offset: 0

Tim Fulford, Dec 28 2013

nonn

Fuss-Catalan sequence is a(n,p,r) = r*binomial(np+r,n)/(np+r), this is the case p=8, 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, A007556, A234461, A234462, A234463, A234464, A234465, A234466, A234467.

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

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

PARI
```
a(n) = 5*binomial(8*n+10,n)/(4*n+5);
```

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

G.f. satisfies: B(x) = {1 + x*B(x)^(p/r)}^r, where p=8, r=10.

A346672 a(n) = Sum_{k=0..n} binomial(8k,k) / (7k + 1).

Original entry on oeis.org

1, 2, 10, 102, 1342, 19620, 305004, 4943352, 82595376, 1412486081, 24602515801, 434935956337, 7783978950825, 140752989839105, 2567623696254905, 47195200645619009, 873239636055018809, 16251426606785706209, 304007720310330530081, 5713101394865420846381

Offset: 0

Ilya Gutkovskiy, Jul 28 2021

nonn

Partial sums of A007556.

In general, for m > 1, Sum_{k=0..n} binomial(m*k,k) / ((m-1)*k + 1) ~ m^(m*(n+1) + 1/2) / (sqrt(2*Pi) * (m^m - (m-1)^(m-1)) * n^(3/2) * (m-1)^((m-1)*n + 3/2)). - Vaclav Kotesovec, Jul 30 2021

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

Cf. A007556, A014137, A104859, A345367, A345368, A346065, A346650, A346671.

Table[Sum[Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 19}]
nmax = 19; A[] = 0; Do[A[x] = 1/(1 - x) + x (1 - x)^7 A[x]^8 + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]

a(n) = sum(k=0, n, binomial(8*k, k)/(7*k+1)); \\ Michel Marcus, Jul 28 2021

G.f. A(x) satisfies: A(x) = 1 / (1 - x) + x * (1 - x)^7 * A(x)^8.

a(n) ~ 2^(24*n + 25) / (15953673 * sqrt(Pi) * n^(3/2) * 7^(7*n + 3/2)). - Vaclav Kotesovec, Jul 30 2021

A349364 G.f. A(x) satisfies: A(x) = 1 + x * A(x)^8 / (1 + x).

Original entry on oeis.org

1, 1, 7, 77, 987, 13839, 205513, 3176747, 50578445, 823779286, 13660621282, 229865812134, 3915003083306, 67361559577578, 1169138502393414, 20444573270374050, 359858503314494318, 6370677542063831319, 113359050598950194801, 2026309136822686950087

Offset: 0

Ilya Gutkovskiy, Nov 15 2021

nonn

In general, for m > 1, Sum_{k=0..n} (-1)^(n-k) * binomial(n-1,k-1) * binomial(m*k,k) / ((m-1)*k+1) ~ (m-1)^(m/2 - 2) * (m^m/(m-1)^(m-1) - 1)^(n + 1/2) / (sqrt(2*Pi) * m^((m-1)/2) * n^(3/2)). - Vaclav Kotesovec, Nov 17 2021

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

Cf. A001006, A007556, A127897, A317133, A346668, A346672 (binomial transform), A349335, A349361, A349362, A349363.

a:= n-> coeff(series(RootOf(1+x*A^8/(1+x)-A, A), x, n+1), x, n):
seq(a(n), n=0..19);  # Alois P. Heinz, Nov 15 2021

nmax = 19; A[] = 0; Do[A[x] = 1 + x A[x]^8/(1 + x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[(-1)^(n - k) Binomial[n - 1, k - 1] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 19}]

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n-1,k-1) * binomial(8*k,k) / (7*k+1).
a(n) = (-1)^(n+1)*F([9/8, 5/4, 11/8, 3/2, 13/8, 7/4, 15/8, 1-n], [9/7, 10/7, 11/7, 12/7, 13/7, 2, 15/7], 8^8/7^7), where F is the generalized hypergeometric function. - Stefano Spezia, Nov 15 2021
a(n) ~ 15953673^(n + 1/2) / (2048 * sqrt(Pi) * n^(3/2) * 7^(7*n + 3/2)). - Vaclav Kotesovec, Nov 17 2021

A346769 a(n) = Sum_{k=0..n} Stirling2(n,k) * binomial(8k,k) / (7k + 1).

Original entry on oeis.org

1, 1, 9, 117, 1849, 33099, 648683, 13652529, 304828941, 7160371928, 175882500852, 4497024667232, 119255943612372, 3270580645588057, 92537409967439493, 2695752129992788115, 80716475549045336327, 2480352681613911495046, 78120174740199126232258

Offset: 0

Ilya Gutkovskiy, Aug 02 2021

nonn

Stirling transform of A007556.

Michael De Vlieger, Table of n, a(n) for n = 0..488

Cf. A007556, A064856, A346764, A346765, A346766, A346767, A346768.

Table[Sum[StirlingS2[n, k] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 18}]
nmax = 18; CoefficientList[Series[Sum[(Binomial[8 k, k]/(7 k + 1)) x^k/Product[1 - j x, {j, 0, k}], {k, 0, nmax}], {x, 0, nmax}], x]
nmax = 18; CoefficientList[Series[HypergeometricPFQ[{1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 7/8}, {2/7, 3/7, 4/7, 5/7, 6/7, 1, 8/7}, 16777216 (Exp[x] - 1)/823543], {x, 0, nmax}], x] Range[0, nmax]!

a(n) = sum(k=0, n, stirling(n, k, 2)*binomial(8*k, k)/(7*k + 1)); \\ Michel Marcus, Aug 02 2021

G.f.: Sum_{k>=0} ( binomial(8*k,k) / (7*k + 1) ) * x^k / Product_{j=0..k} (1 - j*x).

A349303 G.f. A(x) satisfies: A(x) = 1 / ((1 + x) * (1 - x * A(x)^7)).

Original entry on oeis.org

1, 0, 1, 7, 57, 483, 4257, 38675, 359969, 3416329, 32943289, 321888455, 3180249409, 31718822793, 318934721393, 3229639622847, 32907617157641, 337144842511850, 3470986886039193, 35890957497118363, 372584381500477185, 3881595191885835547

Offset: 0

Ilya Gutkovskiy, Nov 13 2021

In general, for k>=1, Sum_{j=0..n} (-1)^(n-k) * binomial(n + (k-1)*j,k*j) * binomial((k+1)*j,j) / (k*j+1) ~ sqrt(1 - (k-1)*r) / (sqrt(2*k*(k+1)*(1+r)*Pi) * (k+1)^(1/k) * n^(3/2) * r^(n + 1/k)), where r is the smallest real root of the equation (k+1)^(k+1) * r = k^k * (1+r)^k. - Vaclav Kotesovec, Nov 14 2021

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

Cf. A005043, A007556, A346627, A346668, A349293, A349299, A349300, A349301, A349302.

nmax = 21; A[] = 0; Do[A[x] = 1/((1 + x) (1 - x A[x]^7)) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
Table[Sum[(-1)^(n - k) Binomial[n + 6 k, 7 k] Binomial[8 k, k]/(7 k + 1), {k, 0, n}], {n, 0, 21}]

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n+6*k,7*k) * binomial(8*k,k) / (7*k+1).
a(n) ~ sqrt(1 - 6*r) / (2^(17/7) * sqrt(7*Pi*(1+r)) * n^(3/2) * r^(n + 1/7)), where r = 0.08937121041965233233945479666512758370169477786851479485467... is the real root of the equation 8^8 * r = 7^7 * (1+r)^7. - Vaclav Kotesovec, Nov 14 2021
From Peter Bala, Jun 02 2024: (Start)
A(x) = 1/(1 + x)*F(x/(1 + x)^7), where F(x) = Sum_{n >= 0} A007556(n)*x^n.
A(x) = 1/(1 + x) + x*A(x)^8. (End)

cp's OEIS Frontend

A349314 G.f. A(x) satisfies: A(x) = (1 + x * A(x)^8) / (1 - x).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A251588 a(n) = 8^(n-6) * (n+1)^(n-8) * (16807*n^6 + 143031*n^5 + 525875*n^4 + 1074745*n^3 + 1294846*n^2 + 876856*n + 262144).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A251698 a(n) = (6*n+1) * (7*n+1)^(n-2) * 8^n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A349335 G.f. A(x) satisfies A(x) = 1 + x * A(x)^8 / (1 - x).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A355262 Array of Fuss-Catalan numbers read by ascending antidiagonals, A(n, k) = binomial(k*n + 1, k)/(k*n + 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A230390 5*binomial(8*n+10,n)/(4*n+5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A346672 a(n) = Sum_{k=0..n} binomial(8*k,k) / (7*k + 1).

Views

Author

Keywords

Comments

A251588 a(n) = 8^(n-6) * (n+1)^(n-8) * (16807n^6 + 143031n^5 + 525875n^4 + 1074745n^3 + 1294846n^2 + 876856n + 262144).

A251698 a(n) = (6n+1) (7n+1)^(n-2) 8^n.

A355262 Array of Fuss-Catalan numbers read by ascending antidiagonals, A(n, k) = binomial(kn + 1, k)/(kn + 1).

A230390 5binomial(8n+10,n)/(4*n+5).

A346672 a(n) = Sum_{k=0..n} binomial(8k,k) / (7k + 1).

A346769 a(n) = Sum_{k=0..n} Stirling2(n,k) * binomial(8k,k) / (7k + 1).