A142465 -id:A142465 - cp's OEIS frontend

A342891 Triangle read by rows: T(n,k) = generalized binomial coefficients (n,k)_12 (n >= 0, 0 <= k <= n).

1, 1, 1, 1, 13, 1, 1, 91, 91, 1, 1, 455, 3185, 455, 1, 1, 1820, 63700, 63700, 1820, 1, 1, 6188, 866320, 4331600, 866320, 6188, 1, 1, 18564, 8836464, 176729280, 176729280, 8836464, 18564, 1, 1, 50388, 71954064, 4892876352, 19571505408, 4892876352, 71954064, 50388, 1

Offset: 0

N. J. A. Sloane, Apr 01 2021

For references, links, programs, etc., see earlier sequences in this series, especially A342889.

			Triangle begins:
  [1],
  [1, 1],
  [1, 13, 1],
  [1, 91, 91, 1],
  [1, 455, 3185, 455, 1],
  [1, 1820, 63700, 63700, 1820, 1],
  [1, 6188, 866320, 4331600, 866320, 6188, 1],
  [1, 18564, 8836464, 176729280, 176729280, 8836464, 18564, 1],
...

Seiichi Manyama, Rows n = 0..139, flattened

Triangles of generalized binomial coefficients (n,k)_m (or generalized Pascal triangles) for m = 1,...,12: A007318 (Pascal), A001263, A056939, A056940, A056941, A142465, A142467, A142468, A174109, A342889, A342890, A342891.

f(n, k, m) = prod(j=1, k, binomial(n-j+m, m)/binomial(j-1+m, m));
T(n, k) = f(n, k, 12); \\ Seiichi Manyama, Apr 02 2021

The generalized binomial coefficient (n,k)m = Product{j=1..k} binomial(n+m-j,m)/binomial(j+m-1,m).

A005364 Hoggatt sequence with parameter d=6.

Original entry on oeis.org

1, 2, 9, 58, 506, 5462, 70226, 1038578, 17274974, 317292692, 6346909285, 136723993122, 3143278648954, 76547029418394, 1962350550273130, 52679691605422354, 1474290522744355250, 42847373913958703100, 1288899422418558314550, 40013380588722843337620

Offset: 0

N. J. A. Sloane

nonn

Let V be the vector representation of SL(6) (of dimension 6) and let E be the exterior algebra of V (of dimension 64). Then a(n) is the dimension of the subspace of invariant tensors in the n-th tensor power of E. - Bruce Westbury, Feb 03 2021

This is the number of 6-vicious walkers (aka vicious 6-watermelons) - see Essam and Guttmann (1995). This is the 6-walker analog of A001181. - N. J. A. Sloane, Mar 27 2021

D. C. Fielder and C. O. Alford, An investigation of sequences derived from Hoggatt sums and Hoggatt triangles, in G. E. Bergum et al., editors, Applications of Fibonacci Numbers: Proc. Third Internat. Conf. on Fibonacci Numbers and Their Applications, Pisa, Jul 25-29, 1988. Kluwer, Dordrecht, Vol. 3, 1990, pp. 77-88.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..573
J. W. Essam and A. J. Guttmann, Vicious walkers and directed polymer networks in general dimensions, Physical Review E, 52(6), (1995) pp. 5849-5862. See (60) and (63).
D. C. Fielder, Letter to N. J. A. Sloane, Jun 1988
D. C. Fielder and C. O. Alford, An investigation of sequences derived from Hoggatt Sums and Hoggatt Triangles, Application of Fibonacci Numbers, 3 (1990) 77-88. Proceedings of 'The Third Annual Conference on Fibonacci Numbers and Their Applications,' Pisa, Italy, July 25-29, 1988. (Annotated scanned copy)
Vaclav Kotesovec, Calculation of the asymptotic formula for the sequence A005366

Row sums of A142465.

Cf. A000079, A000108, A001181, A005362, A005363, A005365, A005366, A116925.

A142465:= func< n,k | (&*[Binomial(n+j,k)/Binomial(k+j,k): j in [0..5]]) >;
A005364:= func< n | (&+[A142465(n,k): k in [0..n]]) >;
[A005364(n): n in [0..40]]; // G. C. Greubel, Nov 13 2022

A005364[n_]:=HypergeometricPFQ[{-5-n,-4-n,-3-n,-2-n,-1-n,-n},{2,3,4,5,6},1] (* Richard L. Ollerton, Sep 13 2006 *)

a(n) = my(d=6); 1 + sum(h=0, n-1, prod(k=0, h, binomial(n+d-1-k,d) / binomial(d + k, d))); \\ Michel Marcus, Feb 08 2021

def A005364(n): return simplify(hypergeometric([-5-n, -4-n, -3-n, -2-n, -1-n, -n],[2, 3, 4, 5, 6], 1))
[A005364(n) for n in range(51)] # G. C. Greubel, Nov 13 2022

a(n) = Hypergeometric6F5([-5-n, -4-n, -3-n, -2-n, -1-n, -n], [2, 3, 4, 5, 6], 1). - Richard L. Ollerton, Sep 13 2006
a(n) = S(6,n) where S(d,n) = 1 + Sum_{h=0..n-1} Product_{k=0..h} binomial(n+d-1-k,d) / binomial(d + k, d) [From Fielder and Alford]. - Sean A. Irvine, May 29 2016
a(n) ~ 135 * 2^(6*n + 40) / (sqrt(3) * Pi^(5/2) * n^(35/2)). - Vaclav Kotesovec, Apr 01 2021

More terms from Sean A. Irvine, May 29 2016

A359363 Triangle read by rows. The coefficients of the Baxter polynomials p(0, x) = 1 and p(n, x) = x*hypergeom([-1 - n, -n, 1 - n], [2, 3], -x) for n >= 1.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 4, 1, 0, 1, 10, 10, 1, 0, 1, 20, 50, 20, 1, 0, 1, 35, 175, 175, 35, 1, 0, 1, 56, 490, 980, 490, 56, 1, 0, 1, 84, 1176, 4116, 4116, 1176, 84, 1, 0, 1, 120, 2520, 14112, 24696, 14112, 2520, 120, 1, 0, 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 1

Offset: 0

Peter Luschny, Dec 28 2022

This triangle is a member of a family of Pascal-like triangles. Let T(n, k, m) = sf(m)*F(n - 1) / (F(k - 1)*F(n - k)) if k > 0 and otherwise k^n, where F(n) = Product_{j=0..m} (n + j)! and sf(m) are the superfactorials A000178. The case m = 2 gives this triangle, some other cases are given in the crossreferences. See also A342889 for a related representation of generalized binomial coefficients.

			Triangle T(n, k) starts:
[0] 1
[1] 0, 1
[2] 0, 1,   1
[3] 0, 1,   4,    1
[4] 0, 1,  10,   10,     1
[5] 0, 1,  20,   50,    20,     1
[6] 0, 1,  35,  175,   175,    35,     1
[7] 0, 1,  56,  490,   980,   490,    56,    1
[8] 0, 1,  84, 1176,  4116,  4116,  1176,   84,   1
[9] 0, 1, 120, 2520, 14112, 24696, 14112, 2520, 120, 1
.
Let p = (p1, p2,..., pn) denote a permutation of {1, 2,..., n}. The pair (p(i), p(i+1)) is a 'rise' if p(i) < p(i+1). Additionally a conventional rise is counted at the beginning of p.
T(n, k) is the number of Baxter permutations of {1,2,...,n} with k rises. For example for n = 4, [T(n, k) for k = 0..n] = [0, 1, 10, 10, 1]. The permutations, with preceding number of rises, are:
.
1 [4, 3, 2, 1],  3 [2, 3, 4, 1],  2 [3, 4, 2, 1],  3 [2, 3, 1, 4],
2 [3, 2, 4, 1],  3 [2, 1, 3, 4],  2 [3, 2, 1, 4],  3 [1, 3, 4, 2],
2 [2, 4, 3, 1],  3 [1, 3, 2, 4],  2 [4, 2, 3, 1],  3 [3, 4, 1, 2],
2 [2, 1, 4, 3],  3 [3, 1, 2, 4],  2 [4, 2, 1, 3],  3 [1, 2, 4, 3],
2 [1, 4, 3, 2],  3 [1, 4, 2, 3],  2 [4, 1, 3, 2],  3 [4, 1, 2, 3],
2 [4, 3, 1, 2],  4 [1, 2, 3, 4].

Special cases of the general formula: A097805 (m = 0), (0,1)-Pascal triangle; A090181 (m = 1), triangle of Narayana; this triangle (m = 2); A056940 (m = 3), with 1,0,0...; A056941 (m = 4), with 1,0,0...; A142465 (m = 5), with 1,0,0....
Variant: A056939. Diagonals: A000292, A006542, A047819.
Cf. A000178, A001181, A046996, A217800, A342889.

p := (n, x) -> ifelse(n = 0, 1, x*hypergeom([-1-n, -n, 1-n], [2, 3], -x)):
seq(seq(coeff(simplify(p(n, x)), x, k), k = 0..n), n = 0..10);
# Alternative:
T := proc(n, k) local F; F := n -> n!*(n+1)!*(n+2)!;
ifelse(k = 0, k^n, 2*F(n-1)/(F(k-1)*F(n-k))) end:
for n from 0 to 9 do seq(T(n, k), k = 0..n) od;

C=binomial;
T(n, k) = if(n==0 && k==0, 1, ( C(n+1,k-1) * C(n+1,k) * C(n+1,k+1) ) / ( C(n+1,1) * C(n+1,2) ) );
for(n=0,10,for(k=0,n,print1(T(n,k),", "));print());
\\ Joerg Arndt, Jan 04 2024

from functools import cache
from math import factorial
@cache
def A359363Row(n: int) -> list[int]:
    @cache
    def F(n: int): return factorial(n) ** 3 * ((n+1) * (n+1) * (n+2))
    if n == 0: return [1]
    return [0] + [(2*F(n-1))//(F(k-1) * F(n-k)) for k in range(1, n+1)]
for n in range(0, 10): print(A359363Row(n))
# Peter Luschny, Jan 04 2024

def A359363(n):
    if n == 0: return SR(1)
    h = x*hypergeometric([-1 - n, -n, 1 - n], [2, 3], -x)
    return h.series(x, n + 1).polynomial(SR)
for n in range(10): print(A359363(n).list())
def PolyA359363(n, t): return Integer(A359363(n)(x=t).n())
# Peter Luschny, Jan 04 2024

T(n, k) = [x^k] p(n, x).
T(n, k) = 2*F(n-1)/(F(k-1)*F(n-k)) for k > 0 where F(n) = n!*(n+1)!*(n+2)!.
p(n, 1) = A001181(n), i.e. the Baxter numbers are the values of the Baxter polynomials at x = 1.
(-1)^(n + 1)*p(2*n + 1, -1) = A217800(n) .

A342972 Triangle T(n,k) read by rows: T(n,k) = Product_{j=0..n-1} binomial(n+j,k)/binomial(k+j,k).

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 10, 10, 1, 1, 35, 105, 35, 1, 1, 126, 1176, 1176, 126, 1, 1, 462, 13860, 41580, 13860, 462, 1, 1, 1716, 169884, 1557270, 1557270, 169884, 1716, 1, 1, 6435, 2147145, 61408347, 184225041, 61408347, 2147145, 6435, 1

Offset: 0

Seiichi Manyama, Apr 01 2021

Triangle read by rows: T(n,k) = generalized binomial coefficients (n,k)n where (n,k)_m is Product{j=1..k} binomial(n-j+m,m)/binomial(j-1+m,m).

			Triangle begins:
  1;
  1,    1;
  1,    3,       1;
  1,   10,      10,        1;
  1,   35,     105,       35,         1;
  1,  126,    1176,     1176,       126,        1;
  1,  462,   13860,    41580,     13860,      462,       1;
  1, 1716,  169884,  1557270,   1557270,   169884,    1716,    1;
  1, 6435, 2147145, 61408347, 184225041, 61408347, 2147145, 6435, 1;

Seiichi Manyama, Rows n = 0..50, flattened

Row sums gives A342967.

T[n_, k_] := Product[Binomial[n + i, k]/Binomial[k + i, k], {i, 0, n - 1}]; Table[T[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Amiram Eldar, Apr 01 2021 *)

T(n, k) = prod(j=0, n-1, binomial(n+j, k)/binomial(k+j, k));

T(n, k) = prod(j=0, k-1, binomial(2*n-1, n+j)/binomial(2*n-1, j));

f(n, k, m) = prod(j=1, k, binomial(n-j+m, m)/binomial(j-1+m, m));
T(n, k) = f(n, k, n);

T(n,k) = Product_{j=0..k-1} binomial(2*n-1,n+j)/binomial(2*n-1,j).

A155834 A triangle sequence of general recursive Sierpinski-Pascal minus general Narayana with adjusted n,m levels and zeros out:k=2; t(n,m)=Pascal(n,m,k-1)-Narayana(n-1,m-1,2*(k-1)).

Original entry on oeis.org

1, 1, 6, 16, 6, 22, 127, 127, 22, 64, 701, 1436, 701, 64, 163, 3117, 11503, 11503, 3117, 163, 382, 12088, 74122, 131494, 74122, 12088, 382, 848, 42890, 413612, 1193930, 1193930, 413612, 42890, 848, 1816, 143562, 2094588, 9280734, 14992440, 9280734

Offset: 4

Roger L. Bagula, Jan 28 2009

Row sums are;
2, 28, 298, 2966, 29566, 304678, 3302560, 38033840, 467861040, 6159690808,
86763791762,...
This level is the Eulerian number level:
only the odd Narayana levels correspond to the recursive Sierpinski-Pascal levels.

			{1, 1},
{6, 16, 6},
{22, 127, 127, 22},
{64, 701, 1436, 701, 64},
{163, 3117, 11503, 11503, 3117, 163},
{382, 12088, 74122, 131494, 74122, 12088, 382},
{848, 42890, 413612, 1193930, 1193930, 413612, 42890, 848},
{1816, 143562, 2094588, 9280734, 14992440, 9280734, 2094588, 143562, 1816},
{3797, 462541, 9928140, 64761204, 158774838, 158774838, 64761204, 9928140, 462541, 3797},
{7814, 1453700, 44960878, 418557816, 1489425900, 2250878592, 1489425900, 418557816, 44960878, 1453700, 7814},
{15914, 4495909, 197226603, 2558716162, 12781854516, 27839586777, 27839586777, 12781854516, 2558716162, 197226603, 4495909, 15914}

A001263, A056939.A056941, A142465, A142467

Clear[A, a0, b0, n, k, m, t, i];
A[n_, 1, m_] := 1; A[n_, n_, m_] := 1;
A[n_, k_, m_] := (m*n - m*k + 1)*A[n - 1, k - 1, m] + (m*k - (m - 1))*A[n - 1, k, m];
t[n_, m_, i_] = Product[Binomial[n + k, m + k]/Binomial[n - m + k, k], {k, 0, i}];
m = 2; a = Table[A[n, k, m - 1] - t[n - 1, k - 1, (2*m - 2)], {n, 4, 14}, { k, 2, n - 1}];
Flatten[a]

Pascal(n,m,k):
a(n,k,m)=(m*n - m*k + 1)*a(n - 1, k - 1, m) + (m*k - (m - 1))*a(n - 1, k, m);
Narayana(n,m,k):
y(n,m,k)=Product[Binomial[n + k, m + k]/Binomial[n - m + k, k], {k, 0, i}];
k=2;
t(n,m)=Pascal(n,m,k-1)-Narayana(n-1,m-1,2*(k-1)).

cp's OEIS Frontend

A342891 Triangle read by rows: T(n,k) = generalized binomial coefficients (n,k)_12 (n >= 0, 0 <= k <= n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A005364 Hoggatt sequence with parameter d=6.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A359363 Triangle read by rows. The coefficients of the Baxter polynomials p(0, x) = 1 and p(n, x) = x*hypergeom([-1 - n, -n, 1 - n], [2, 3], -x) for n >= 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

PARI

Python

SageMath

Formula

A342972 Triangle T(n,k) read by rows: T(n,k) = Product_{j=0..n-1} binomial(n+j,k)/binomial(k+j,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Formula

A155834 A triangle sequence of general recursive Sierpinski-Pascal minus general Narayana with adjusted n,m levels and zeros out:k=2; t(n,m)=Pascal(n,m,k-1)-Narayana(n-1,m-1,2*(k-1)).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula