cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A145370 Lower triangular array, called S1hat(-4), related to partition number array A145369.

Original entry on oeis.org

1, 4, 1, 12, 4, 1, 24, 28, 4, 1, 24, 72, 28, 4, 1, 0, 264, 136, 28, 4, 1, 0, 384, 456, 136, 28, 4, 1, 0, 864, 1344, 712, 136, 28, 4, 1, 0, 576, 4128, 2112, 712, 136, 28, 4, 1, 0, 576, 7488, 7968, 3136, 712, 136, 28, 4, 1, 0, 0, 13248, 20544, 11040, 3136, 712, 136, 28, 4, 1, 0, 0
Offset: 1

Views

Author

Wolfdieter Lang, Oct 17 2008

Keywords

Comments

If in the partition array M31hat(-4):=A145369 entries belonging to partitions with the same parts number m are summed one obtains this triangle of numbers S1hat(-4). In the same way the signless Stirling1 triangle |A008275| is obtained from the partition array M_2 = A036039.
The first column is [1,4,12,24,24,0,0,0,...]= A008279(4,n-1), n>=1.

Examples

			Triangle begins:
  [1];
  [4,1];
  [12,4,1];
  [24,28,4,1];
  [24,72,28,4,1];
  ...
		

Crossrefs

Cf. A145371 (row sums).

Formula

a(n,m) = sum(product(S1(-4;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, Y and e(n,m,q,j) is the exponent of j in the q-th m part partition of n. S1(-4,n,1)= A008279(4,n-1) = [1,4,12,24,24,0,0,0,...], n>=1.

A145374 Row sums of triangle A145373 (S1hat(-5)) and partition array A145372 (M31hat(-5)).

Original entry on oeis.org

1, 6, 26, 111, 331, 1276, 3576, 14301, 43401, 142626, 422526, 1501051, 4244551, 13621176, 41578676, 130893801, 378009301, 1188872926, 3428610426, 10769968551, 31120656051, 92887286676, 269920084176, 830429397301, 2353647784801
Offset: 0

Views

Author

Wolfdieter Lang, Oct 17 2008, Nov 13 2008

Keywords

Crossrefs

Cf. A145372, A145373, A145371 (row sums of triangle A145370 (S1hat(-4))).

Formula

a(n) = Sum_{m=1..n} A145373(n,m), n>=1.
Showing 1-2 of 2 results.