A000582 -id:A000582 - cp's OEIS frontend

A095819 Tenth column (m=9) of (1,4)-Pascal triangle A095666.

4, 37, 190, 715, 2200, 5863, 14014, 30745, 62920, 121550, 223652, 394706, 671840, 1107890, 1776500, 2778446, 4249388, 6369275, 9373650, 13567125, 19339320, 27183585, 37718850, 51714975, 70122000, 94103724, 125076072, 164750740

Offset: 0

Wolfdieter Lang, Jun 11 2004

If Y is a 4-subset of an n-set X then, for n>=12, a(n-12) is the number of 9-subsets of X having at most one element in common with Y. - Milan Janjic, Dec 08 2007

G.f.: (4-3*x)/(1-x)^10.

a(n) = 4*b(n)-3*b(n-1) =(n+36)*binomial(n+8, 8)/9, with b(n):=binomial(n+9, 9)=A000582(n+9, 9).

A096947 Tenth column of (1,5)-Pascal triangle A096940.

Original entry on oeis.org

5, 46, 235, 880, 2695, 7150, 17017, 37180, 75790, 145860, 267410, 470288, 797810, 1311380, 2096270, 3268760, 4984859, 7450850, 10935925, 15787200, 22447425, 31475730, 43571775, 59603700, 80640300, 107987880, 143232276, 188286560

Offset: 0

Wolfdieter Lang, Jul 16 2004

If Y is a 5-subset of an n-set X then, for n>=13, a(n-13) is the number of 9-subsets of X having at most one element in common with Y. - Milan Janjic, Dec 08 2007

Index entries for linear recurrences with constant coefficients, signature (10,-45,120,-210,252,-210,120,-45,10,-1).

Ninth column: A096946.

CoefficientList[Series[(5-4x)/(1-x)^10,{x,0,40}],x] (* Harvey P. Dale, Jan 06 2020 *)

a(n) = (n+45)*binomial(n+8, 8)/9.
a(n) = 5*b(n)-4*b(n-1), with b(n) = A000582(n+9) = binomial(n+9, 9).
G.f.: (5-4*x)/(1-x)^10.

A270950 Number of distinct cardinalities of orbits of lattice points under the automorphism group of the n-dimensional integer lattice.

Original entry on oeis.org

0, 1, 2, 5, 9, 12, 20, 29, 40, 53, 76, 99, 132, 172, 216, 270, 341, 424, 532, 660, 810, 983, 1210, 1446, 1750, 2111, 2508, 2975, 3569, 4197, 4948, 5807, 6817, 7963, 9351, 10863, 12604, 14598, 16892, 19439, 22472, 25780, 29588, 33892, 38800, 44206, 50463, 57297, 65086, 73919, 83842, 94510

Offset: 0

Philippe A.J.G. Chevalier, Mar 26 2016

A finite number of orbits partition hypercubic shells of infinity norm s in the n-dimensional integer lattice. The number of orbits is given by C(n+s-1,s). The number of distinct cardinalities of the orbits of lattice points under the automorphism group of the n-dimensional integer lattice is found under the condition that n <= s.

A new connection was discovered using the partition of the dimension 'n'. These partitions create a base set of cardinalities. Each of these cardinalities can be subjected to the process of prime factorization. The prime factorization yields the exponents of the primes that form lattice points in a new integer lattice of dimension 'n'. These lattice points become elements of a set A. The unique summands of a specific partition of 'n' give the multipliers of the base vector (1,0^n) that need to be subtracted from the specific partition representative element of set A. The cardinality of the set A increases until all the specific partitions of 'n' have been processed. This augmented set A* has the correct cardinality. This method is much faster than the brute force technique. - Philippe A.J.G. Chevalier, Jun 24 2022

			For n=0 the a(0)=0.
For n=3 we have the following distinct cardinalities of the orbits 6, 8, 12, 24, 48 and thus a(3)=5.
For n=4 we have the distinct cardinalities of the orbits 8, 16, 24, 32, 48, 64, 96, 192, 384 and thus a(4)=9.
For n=5 we have the distinct cardinalities of the orbits 10, 32, 40, 160, 240, 320, 480, 640, 960, 1920, 3840 and thus a(5)=12.

Philippe A.J.G. Chevalier, Table of n, a(n) for n = 0..54

Cf. A000217, A000292, A000332, A000389, A000579, A000580, A000581, A000582, A001287.

a(17) corrected and a(18)-a(51) from Philippe A.J.G. Chevalier, Jun 24 2022

A347056 Triangle read by rows: T(n,k) = (n+1)(n+2)(k+3)*binomial(n,k)/6, 0 <= k <= n.

Original entry on oeis.org

1, 3, 4, 6, 16, 10, 10, 40, 50, 20, 15, 80, 150, 120, 35, 21, 140, 350, 420, 245, 56, 28, 224, 700, 1120, 980, 448, 84, 36, 336, 1260, 2520, 2940, 2016, 756, 120, 45, 480, 2100, 5040, 7350, 6720, 3780, 1200, 165, 55, 660, 3300, 9240, 16170, 18480, 13860, 6600, 1815, 220

Offset: 0

Luc Rousseau, Aug 14 2021

This triangle is T[3] in the sequence (T[p]) of triangles defined by: T[p](n,k) = (k+p)*(n+p-1)!/(k!*(n-k)!*p!) and T[0](0,0)=1.

Riordan triangle (1/(1-x)^3, x/(1-x)) with column k scaled with A000292(k+1) = binomial(k+3, 3), for k >= 0. - Wolfdieter Lang, Sep 30 2021

			T(6,2) = (6+1)*(6+2)*(2+3)*binomial(6,2)/6 = 7*8*5*15/6 = 700.
The triangle T begins:
n \ k  0   1    2     3     4     5     6     7     8    9  10 ...
0:     1
1:     3   4
2:     6  16   10
3:    10  40   50    20
4:    15  80  150   120    35
5:    21 140  350   420   245    56
6:    28 224  700  1120   980   448    84
7:    36 336 1260  2520  2940  2016   756   120
8:    45 480 2100  5040  7350  6720  3780  1200   165
9:    55 660 3300  9240 16170 18480 13860  6600  1815  220
10:   66 880 4950 15840 32340 44352 41580 26400 10890 2640 286
... - _Wolfdieter Lang_, Sep 30 2021

Luc Rousseau, Illustration: the A347056 triangle in a sequence of contiguous triangles.

Cf. A097805 (p=0), A103406 (p=1), A124932 (essentially p=2).
From Wolfdieter Lang, Sep 30 2021: (Start)
Columns (with leading zeros): A000217(n+1), 4*A000294, 10*A000332(n+2), 20*A000389(n+2), 35*A000579(n+2), 56*A000580(n+2), 84*A000581(n+2), 120*A000582(n+2), ...
Diagonals: A000292(k+1), A004320(k+1), 2*A006411(k+1), 10*A040977, ... (End)

T(p,n,k)=if(n==0&&p==0,1,((k+p)*(n+p-1)!)/(k!*(n-k)!*p!))
for(n=0,9,for(k=0,n,print1(T(3,n,k),", ")))

T(n,k) = (n+1)*(n+2)*(k+3)*binomial(n,k)/6.

G.f. column k: x^k*binomial(k+3, 3)/(1 - x)^(k+3), for k >= 0. - Wolfdieter Lang, Sep 30 2021

A356037 Conjecturally, a(n) is the smallest number m such that every natural number is a sum of at most m n-simplex numbers.

Original entry on oeis.org

1, 3, 5, 8, 10, 13, 15, 15, 19, 24

Offset: 1

Mohammed Yaseen, Jul 24 2022

n-simplex numbers are {binomial(k,n); k>=n}.
This problem is the simplex number analog of Waring's problem.
a(2) = 3 was proposed by Fermat and proved by Gauss, see A061336.
Pollock conjectures that a(3) = 5. Salzer and Levine prove this for numbers up to 452479659. See A104246 and A000797.
Kim gives a(4)=8, a(5)=10, a(6)=13 and a(7)=15 (not proved).

			2-simplex numbers are {binomial(k,2); k>=2} = {1,3,6,10,...}, the triangular numbers. 3 is the smallest number m such that every natural number is a sum of at most m triangular numbers. So a(2)=3.
3-simplex numbers are {binomial(k,3); k>=3} = {1,4,10,20,...}, the tetrahedral numbers. 5 is presumed to be the smallest number m such that every natural number is a sum of at most m tetrahedral numbers. So a(3)=5.

Hyun Kwang Kim, On regular polytope numbers, Proc. Amer. Math. Soc. 131 (2003), p. 65-75.

Cf. A002804, A079611.
Minimal number of x-simplex numbers whose sum equals n: A061336 (x=2), A104246 (x=3), A283365 (x=4), A283370 (x=5).
x-simplex numbers: A000217 (x=2), A000292 (x=3), A000332 (x=4), A000389 (x=5), A000579 (x=6), A000580 (x=7), A000581 (x=8), A000582 (x=9).

cp's OEIS Frontend

A095819 Tenth column (m=9) of (1,4)-Pascal triangle A095666.

Views

Author

Keywords

Comments

Formula

A096947 Tenth column of (1,5)-Pascal triangle A096940.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A270950 Number of distinct cardinalities of orbits of lattice points under the automorphism group of the n-dimensional integer lattice.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A347056 Triangle read by rows: T(n,k) = (n+1)*(n+2)*(k+3)*binomial(n,k)/6, 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A356037 Conjecturally, a(n) is the smallest number m such that every natural number is a sum of at most m n-simplex numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A347056 Triangle read by rows: T(n,k) = (n+1)(n+2)(k+3)*binomial(n,k)/6, 0 <= k <= n.