A096807 -id:A096807 - cp's OEIS frontend

A096806 Triangle, read by rows, such that the binomial transform of the n-th row lists the m-dimensional partitions of n, for n>=1 and m>=0.

1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 6, 11, 7, 1, 1, 10, 27, 28, 11, 1, 1, 14, 57, 93, 64, 16, 1, 1, 21, 117, 269, 282, 131, 22, 1, 1, 29, 223, 707, 1062, 766, 244, 29, 1, 1, 41, 417, 1747, 3565, 3681, 1871, 421, 37, 1, 1, 55, 748, 4090, 10999, 15489, 11400, 4152, 683, 46, 1, 1, 76

Offset: 1

Paul D. Hanna, Jul 19 2004

The n-th row equals the inverse binomial transform of n-th column of square array A096751, for n>=1. The zero-dimensional partition of n is taken to be 1 for all n.

			The number of m-dimensional partitions of 5, for m>=0, is given by the binomial transform of the 5th row:
BINOMIAL([1,6,11,7,1]) = [1,7,24,59,120,216,357,554,819,1165,...] = A008779.
Rows begin:
  [1],
  [1,  1],
  [1,  2,   1],
  [1,  4,   4,    1],
  [1,  6,  11,    7,     1],
  [1, 10,  27,   28,    11,     1],
  [1, 14,  57,   93,    64,    16,      1],
  [1, 21, 117,  269,   282,   131,     22,      1],
  [1, 29, 223,  707,  1062,   766,    244,     29,     1],
  [1, 41, 417, 1747,  3565,  3681,   1871,    421,    37,     1],
  [1, 55, 748, 4090, 10999, 15489,  11400,   4152,   683,    46,    1],
  [1, 76,1326, 9219, 31828, 58975,  59433,  31802,  8483,  1054,   56,   1],
  [1,100,2284,20095, 87490,207735, 276230, 204072, 80664, 16162, 1561,  67, 1],
  [1,134,3898,42707,230737,687665,1173533,1148939,632478,188077,29031,2234,79,1],
  ...
The inverse binomial transform of the diagonals of this triangle begin:
  [1],
  [1, 1,  1],
  [1, 3,  4,   6,  3],
  [1, 5, 16,  29,  49,   45,   15],
  [1, 9, 38, 127, 289,  540,  660,   420, 105],
  [1,13, 90, 397,1384, 3633, 7506, 10920,9765,4725,945],
  [1,20,182,1140,5266,19324,55645,125447,  ? ,  ? , ?  ,62370,10395],
  ...

S. Govindarajan, Notes on higher-dimensional partitions, arXiv:1203.4419 [math.CO], 2012.

Cf. A096751, A096807 (row sums), A000065 (column k=1?), A008778 (bin trans 4th row), A042984 (bin trans 6th row)

Cf. A119271.

T(n, 0)=T(n, n-1)=1, T(n, 1)=A000041(n)-1, T(n, n-2)=(n-1)*(n-2)/2+1, for n>=1.

A116673 Row sums of triangle A116672, in which the binomial transform of the n-th row lists the Euler transform of the n-th sequence in A007318 (Pascal's Triangle).

Original entry on oeis.org

1, 2, 4, 10, 26, 80, 262, 950

Offset: 1

Alford Arnold, Feb 22 2006

nonn

A116673 is to A096807 as Table A116672 is to Table A096806. The difference between the two tables is of historical interest. (cf. A096751 and A007326).

			A116672 begins
1; 1,1; 1,2,1; 1,4,4,1; 1,6,11,7,1; 1,10,27,29,12,1; 1,14,57,96,72,21,1; 1,21,117,277,319,176,38,1; . . . so
A116673 begins 1 2 4 10 26 80 262 950 ...

Cf. A007318, A007326, A096751, A096806, A096807, A116672.

cp's OEIS Frontend

A096806 Triangle, read by rows, such that the binomial transform of the n-th row lists the m-dimensional partitions of n, for n>=1 and m>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula