A145363 -id:A145363 - cp's OEIS frontend

A145364 Lower triangular array, called S1hat(-2), related to partition number array A145363.

1, 2, 1, 2, 2, 1, 0, 6, 2, 1, 0, 4, 6, 2, 1, 0, 4, 12, 6, 2, 1, 0, 0, 12, 12, 6, 2, 1, 0, 0, 8, 28, 12, 6, 2, 1, 0, 0, 8, 24, 28, 12, 6, 2, 1, 0, 0, 0, 24, 56, 28, 12, 6, 2, 1, 0, 0, 0, 16, 56, 56, 28, 12, 6, 2, 1, 0, 0, 0, 16, 48, 120, 56, 28, 12, 6, 2, 1, 0, 0, 0, 0, 48, 112, 120, 56, 28, 12, 6, 2, 1

Offset: 1

Wolfdieter Lang, Oct 17 2008

If in the partition array M31hat(-2):=A145363 entries belonging to partitions with the same parts number m are summed one obtains this triangle of numbers S1hat(-2). In the same way the signless Stirling1 triangle |A008275| is obtained from the partition array M_2 = A036039.

The first column is [1,2,2,0,0,0,...]= A008279(2,n-1), n>=1.

			Triangle begins:
  [1];
  [2,1];
  [2,2,1];
  [0,6,2,1];
  [0,4,6,2,1];
  ...

Wolfdieter Lang, First 10 rows of the array and more.
Wolfdieter Lang, Combinatorial Interpretation of Generalized Stirling Numbers, J. Int. Seqs. Vol. 12 (2009) 09.3.3.

Cf. A145365 (row sums).

a(n,m) = sum(product(S1(-2;j,1)^e(n,m,q,j),j=1..n),q=1..p(n,m)) if n>=m>=1, else 0. Here p(n,m)=A008284(n,m), the number of m parts partitions of n and e(n,m,q,j) is the exponent of j in the q-th m part partition of n. S1(-2,n,1)= A008279(2,n-1) = [1,2,2,0,0,0,...], n>=1.

A145365 Row sums of triangle A145364 (S1hat(-2)) and partition array A145363 (M31hat(-2)).

Original entry on oeis.org

1, 3, 5, 9, 13, 25, 33, 57, 81, 129, 177, 289, 385, 609, 833, 1281, 1729, 2689, 3585, 5505, 7425, 11265, 15105, 23041, 30721

Offset: 1

Wolfdieter Lang, Oct 17 2008

Cf. A145363, A145364.

a(n) = Sum_{m=1..n} A145364(n,m), n>=1.

Offset changed from 0 to 1. - Wolfdieter Lang, Nov 25 2008

A145366 Partition number array, called M31hat(-3).

Original entry on oeis.org

1, 3, 1, 6, 3, 1, 6, 6, 9, 3, 1, 0, 6, 18, 6, 9, 3, 1, 0, 0, 18, 36, 6, 18, 27, 6, 9, 3, 1, 0, 0, 0, 36, 0, 18, 36, 54, 6, 18, 27, 6, 9, 3, 1, 0, 0, 0, 0, 36, 0, 0, 36, 54, 108, 0, 18, 36, 54, 81, 6, 18, 27, 6, 9, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 36, 0, 108, 216, 0, 0, 36, 54, 108, 162, 0, 18, 36, 54, 81

Offset: 1

Wolfdieter Lang, Oct 17 2008

If all positive numbers are replaced by 1 this becomes the characteristic partition array for partitions with parts 1,2,3 or 4 only, provided the partitions of n are ordered like in Abramowitz-Stegun (A-St order; for the reference see A134278).
Third member (K=3) in the family M31hat(-K) of partition number arrays.
The sequence of row lengths is A000041 (partition numbers) [1, 2, 3, 5, 7, 11, 15, 22, 30, 42,...].
This array is array A144877 divided entrywise by the array M_3=M3(1)=A036040. Formally 'A144877/A036040'. E.g. a(4,3)= 9 = 27/3 = A144877(4,3)/A036040(4,3).
If M31hat(-3;n,k) is summed over those k numerating partitions with fixed number of parts m one obtains the unsigned triangle S1hat(-3):= A145367.

			Triangle begins:
  [1];
  [3,1];
  [6,3,1];
  [6,6,9,3,1];
  [0,6,18,6,9,3,1];
  ...
a(4,3)= 9 = S1(-3;2,1)^2. The relevant partition of 4 is (2^2).

Wolfdieter Lang, First 10 rows of the array and more.
Wolfdieter Lang, Combinatorial Interpretation of Generalized Stirling Numbers, J. Int. Seqs. Vol. 12 (2009) 09.3.3.

Cf. A145363 (M31hat(-2)). A145369 (M31hat(-4)).

a(n,k) = product(S1(-3;j,1)^e(n,k,j),j=1..n) with S1(-3;n,1) = A008279(3,n-1) = [1,3,6,6,0,0,0,...], n>=1 and the exponent e(n,k,j) of j in the k-th partition of n in the A-St ordering of the partitions of n.

A145361 Characteristic partition array for partitions with parts 1 and 2 only.

Original entry on oeis.org

1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Wolfdieter Lang, Oct 17 2008

Each partition of n, ordered like in Abramowitz-Stegun (A-St order; for the reference see A134278), is mapped to 1 if the partition has parts 1 or 2 only and to 0 otherwise.
First member (K=1) in the family M31hat(-K) of partition number arrays.
The sequence of row lengths is A000041 (partition numbers) [1, 2, 3, 5, 7, 11, 15, 22, 30, 42,...].
This array is array A144357 divided entrywise by the array M_3=M3(1)=A036040. Formally 'A144357/A036040'. E.g. a(4,3)= 1 = 3/3 = A144357(4,3)/A036040(4,3).
If M31hat(-1;n,k) is summed over those k numerating partitions with fixed number of parts m one obtains the unsigned triangle S1hat(-1):= A145362 .

			Triangle begins:
  [1];
  [1,1];
  [0,1,1];
  [0,0,1,1,1];
  [0,0,0,0,1,1,1];
  ...
a(4,3)= 1 = S1(-1;2,1)^2. The relevant partition of 4 is (2^2).

Wolfdieter Lang, First 10 rows of the array and more.
Wolfdieter Lang, Combinatorial Interpretation of Generalized Stirling Numbers, J. Int. Seqs. Vol. 12 (2009) 09.3.3.

Cf. A145363 (M31hat(-2)).

a(n,k) = product(S1(-1;j,1)^e(n,k,j),j=1..n) with S1(-1;n,1) = A008279(1,n-1) = [1,1,0,0,0,...], n>=1 and the exponent e(n,k,j) of j in the k-th partition of n in the A-St ordering of the partitions of n.

cp's OEIS Frontend

A145364 Lower triangular array, called S1hat(-2), related to partition number array A145363.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A145365 Row sums of triangle A145364 (S1hat(-2)) and partition array A145363 (M31hat(-2)).

Views

Author

Keywords

Crossrefs

Formula

Extensions

A145366 Partition number array, called M31hat(-3).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A145361 Characteristic partition array for partitions with parts 1 and 2 only.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula