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-9 of 9 results.

A026792 List of juxtaposed reverse-lexicographically ordered partitions of the positive integers.

Original entry on oeis.org

1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 4, 2, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1, 5, 3, 2, 4, 1, 2, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 6, 3, 3, 4, 2, 2, 2, 2, 5, 1, 3, 2, 1, 4, 1, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 4, 3, 5, 2, 3, 2, 2, 6, 1, 3, 3, 1, 4, 2, 1, 2, 2, 2, 1, 5, 1, 1, 3, 2, 1, 1, 4, 1, 1, 1, 2, 2, 1
Offset: 1

Views

Author

Keywords

Comments

The representation of the partitions (for fixed n) is as (weakly) decreasing lists of parts, the order between individual partitions (for the same n) is (list-)reversed lexicographic; see examples. [Joerg Arndt, Sep 03 2013]
Written as a triangle; row n has length A006128(n); row sums give A066186. Also written as an irregular tetrahedron in which T(n,j,k) is the k-th largest part of the j-th partition of n; the sum of column k in the slice n is A181187(n,k); right border of the slices gives A182715. - Omar E. Pol, Mar 25 2012
The equivalent sequence for compositions (ordered partitions) is A228351. - Omar E. Pol, Sep 03 2013
This is the reverse-colexicographic order of integer partitions, or the reflected reverse-lexicographic order of reversed integer partitions. It is not reverse-lexicographic order (A080577), wherein we would have (3,1) before (2,2). - Gus Wiseman, May 12 2020

Examples

			E.g. the partitions of 3 (3,2+1,1+1+1) appear as the string 3,2,1,1,1,1.
So the list begins:
1
2, 1, 1,
3, 2, 1, 1, 1, 1,
4, 2, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1,
5, 3, 2, 4, 1, 2, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1,
...
From _Omar E. Pol_, Sep 03 2013: (Start)
Illustration of initial terms:
---------------------------------
n  j     Diagram     Partition
---------------------------------
.         _
1  1     |_|         1;
.         _ _
2  1     |_  |       2,
2  2     |_|_|       1, 1;
.         _ _ _
3  1     |_ _  |     3,
3  2     |_  | |     2, 1,
3  3     |_|_|_|     1, 1, 1;
.         _ _ _ _
4  1     |_ _    |   4,
4  2     |_ _|_  |   2, 2,
4  3     |_ _  | |   3, 1,
4  4     |_  | | |   2, 1, 1,
4  5     |_|_|_|_|   1, 1, 1, 1;
...
(End)
From _Gus Wiseman_, May 12 2020: (Start)
This sequence can also be interpreted as the following triangle, whose n-th row is itself a finite triangle with A000041(n) rows. Showing these partitions as their Heinz numbers gives A334436.
                             0
                            (1)
                          (2)(11)
                        (3)(21)(111)
                   (4)(22)(31)(211)(1111)
             (5)(32)(41)(221)(311)(2111)(11111)
  (6)(33)(42)(222)(51)(321)(411)(2211)(3111)(21111)(111111)
(End)
		

Crossrefs

The reflected version for reversed partitions is A080577.
The partition minima appear to be A182715.
The graded reversed version is A211992.
The version for compositions is A228351.
The Heinz numbers of these partitions are A334436.

Programs

  • Mathematica
    revcolex[f_,c_]:=OrderedQ[PadRight[{Reverse[c],Reverse[f]}]];
    Join@@Table[Sort[IntegerPartitions[n],revcolex],{n,0,8}] (* reverse-colexicographic order, Gus Wiseman, May 10 2020 *)
    - or -
    revlex[f_,c_]:=OrderedQ[PadRight[{c,f}]];
    Reverse/@Join@@Table[Sort[Reverse/@IntegerPartitions[n],revlex],{n,0,8}] (* reflected reverse-lexicographic order, Gus Wiseman, May 12 2020 *)

Extensions

Terms 81st, 83rd and 84th corrected by Omar E. Pol, Aug 16 2009

A193870 Triangle of regions and partitions of integers (see Comments lines for definition).

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 2, 0, 0, 0, 4, 2, 1, 1, 1, 3, 0, 0, 0, 0, 0, 5, 2, 1, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Omar E. Pol, Aug 07 2011

Keywords

Comments

Triangle T(n,k) read by rows in which, from rows 1..n, if r = T(n,k) is a record in the sequence then the set of positive integers in every row (from 1 to n) is called a “region” of r. Note that n, the number of regions of r is also the number of partitions of r. The consecutive records "r" are the natural numbers A000027. The triangle has the property that, for rows n..1, the diagonals (without the zeros) are also the partitions of r, in juxtaposed reverse-lexicographical order. Note that a record "r" is the initial term of a row if such row contains 1’s. If T(n,k) is a record in the sequence then A000041(T(n,k)) = n. Note that if T(n,k) < 2 is not the last term of the row n then T(n,k+1) = T(n,k). The union of the rows that contain 1's gives A182715.

Examples

			Triangle begins:
1,
2, 1,
3, 1, 1,
2, 0, 0, 0,
4, 2, 1, 1, 1,
3, 0, 0, 0, 0, 0,
5, 2, 1, 1, 1, 1, 1,
2, 0, 0, 0, 0, 0, 0, 0,
4, 2, 0, 0, 0, 0, 0, 0, 0,
3, 0, 0, 0, 0, 0, 0, 0, 0, 0,
6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1,
…
For n = 11 note that the row n contains the 6th record in the sequence: T(11,1) = a(56) = 6, then consider the first 11 rows of triangle. Note that the diagonals d, from d = n..1, without the zeros, are also the partitions of 6 in juxtaposed reverse-lexicographical order: [6], [3, 3], [4, 2], [2, 2, 2], [5, 1], [3, 2, 1], [4, 1, 1], [2, 2, 1, 1], [3, 1, 1, 1], [2, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1]. See A026792.
		

Crossrefs

Mirror of triangle A186114. Column 1 gives A141285. Right diagonal gives A167392.

Programs

Formula

T(n,1) = A141285(n).
T(n,k) = A167392(n), if k = n.

A228531 Triangle read by rows in which row n lists the partitions of n in reverse lexicographic order.

Original entry on oeis.org

1, 2, 1, 1, 3, 1, 2, 1, 1, 1, 4, 2, 2, 1, 3, 1, 1, 2, 1, 1, 1, 1, 5, 2, 3, 1, 4, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 6, 3, 3, 2, 4, 2, 2, 2, 1, 5, 1, 2, 3, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 7, 3, 4, 2, 5, 2, 2, 3, 1, 6
Offset: 1

Views

Author

Omar E. Pol, Aug 30 2013

Keywords

Comments

The representation of the partitions (for fixed n) is as (weakly) increasing lists of parts, the order between individual partitions (for the same n) is (list-)reversed lexicographic; see examples. [Joerg Arndt, Sep 03 2013]
Also compositions in the triangle of A066099 that are in nondecreasing order.
The equivalent sequence for compositions (ordered partitions) is A066099.
Row n has length A006128(n).
Row sums give A066186.

Examples

			Illustration of initial terms:
---------------------------------
.                    Ordered
n  j     Diagram     partition
---------------------------------
.              _
1  1          |_|    1;
.            _ _
2  1        |  _|    2,
2  2        |_|_|    1, 1;
.          _ _ _
3  1      |  _ _|    3,
3  2      | |  _|    1, 2,
3  3      |_|_|_|    1, 1, 1;
.        _ _ _ _
4  1    |    _ _|    4,
4  2    |  _|_ _|    2, 2,
4  3    | |  _ _|    1, 3,
4  4    | | |  _|    1, 1, 2,
4  5    |_|_|_|_|    1, 1, 1, 1;
.
Triangle begins:
[1];
[2],[1,1];
[3],[1,2],[1,1,1];
[4],[2,2],[1,3],[1,1,2],[1,1,1,1];
[5],[2,3],[1,4],[1,2,2],[1,1,3],[1,1,1,2],[1,1,1,1,1];
[6],[3,3],[2,4],[2,2,2],[1,5],[1,2,3],[1,1,4],[1,1,2,2],[1,1,1,3],[1,1,1,1,2],[1,1,1,1,1,1];
[7],[3,4],[2,5],[2,2,3],[1,6],[1,3,3],[1,2,4],[1,2,2,2],[1,1,5],[1,1,2,3],[1,1,1,4],[1,1,1,2,2],[1,1,1,1,3],[1,1,1,1,1,2],[1,1,1,1,1,1,1];
...
		

Crossrefs

Row lengths are A000041.
Partition sums are A036042.
Partition minima are A182715.
Partition lengths are A333486.
The lexicographic version (sum/lex) is A026791.
Compositions under the same order (sum/revlex) are A066099.
The colexicographic version (sum/colex) is A080576.
The version for non-reversed partitions is A080577.
The length-sensitive version (sum/length/revlex) is A334302.
The Heinz numbers of these partitions are A334436.
Partitions in colexicographic order (sum/colex) are A211992.
Partitions in lexicographic order (sum/lex) are A193073.

Programs

  • Mathematica
    revlexsort[f_,c_]:=OrderedQ[PadRight[{c,f}]];
    Join@@Table[Sort[Reverse/@IntegerPartitions[n],revlexsort],{n,0,8}] (* Gus Wiseman, May 23 2020 *)

A238966 The number of distinct primes in divisor lattice in canonical order.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 3, 1, 2, 2, 3, 4, 1, 2, 2, 3, 3, 4, 5, 1, 2, 2, 3, 2, 3, 4, 3, 4, 5, 6, 1, 2, 2, 3, 2, 3, 4, 3, 3, 4, 5, 4, 5, 6, 7, 1, 2, 2, 3, 2, 3, 4, 2, 3, 3, 4, 5, 3, 4, 4, 5, 6, 4, 5, 6, 7, 8, 1, 2, 2, 3, 2, 3, 4, 2, 3, 3, 4, 5, 3, 3, 4, 4, 5, 6, 3, 4, 5, 4, 5, 6, 7, 5, 6, 7, 8, 9
Offset: 0

Views

Author

Sung-Hyuk Cha, Mar 07 2014

Keywords

Comments

After a(0) = 0, this appears to be the same as A128628. - Gus Wiseman, May 24 2020
Also the number of parts in the n-th integer partition in graded reverse-lexicographic order (A080577). - Gus Wiseman, May 24 2020

Examples

			Triangle T(n,k) begins:
  0;
  1;
  1, 2;
  1, 2, 3;
  1, 2, 2, 3, 4;
  1, 2, 2, 3, 3, 4, 5;
  1, 2, 2, 3, 2, 3, 4, 3, 4, 5, 6;
  ...
		

Crossrefs

Row sums are A006128.
Cf. A036043 in canonical order.
Row lengths are A000041.
The generalization to compositions is A000120.
The sum of the partition is A036042.
The lexicographic version (sum/lex) is A049085.
Partition lengths of A080577.
The partition has A115623 distinct elements.
The Heinz number of the partition is A129129.
The colexicographic version (sum/colex) is A193173.
The maximum of the partition is A331581.
Partitions in lexicographic order (sum/lex) are A193073.
Partitions in colexicographic order (sum/colex) are A211992.

Programs

  • Maple
    o:= proc(n) option remember; nops(ifactors(n)[2]) end:
    b:= (n, i)-> `if`(n=0 or i=1, [[1$n]], [map(x->
        [i, x[]], b(n-i, min(n-i, i)))[], b(n, i-1)[]]):
    T:= n-> map(x-> o(mul(ithprime(i)^x[i], i=1..nops(x))), b(n$2))[]:
    seq(T(n), n=0..9);  # Alois P. Heinz, Mar 26 2020
  • Mathematica
    revlexsort[f_,c_]:=OrderedQ[PadRight[{c,f}]];
    Table[Length/@Sort[IntegerPartitions[n],revlexsort],{n,0,8}] (* Gus Wiseman, May 24 2020 *)
    b[n_, i_] := b[n, i] = If[n == 0 || i == 1, {Table[1, {n}]}, Join[ Prepend[#, i]& /@ b[n - i, Min[n - i, i]], b[n, i - 1]]];
    P[n_] := P[n] = Product[Prime[i]^#[[i]], {i, 1, Length[#]}]& /@ b[n, n];
    T[n_, k_] := PrimeNu[P[n][[k + 1]]];
    Table[T[n, k], {n, 0, 9}, {k, 0, Length[P[n]] - 1}] // Flatten (* Jean-François Alcover, Jan 03 2022, after Alois P. Heinz in A063008 *)
  • PARI
    Row(n)={apply(s->#s, vecsort([Vecrev(p) | p<-partitions(n)], , 4))}
    { for(n=0, 8, print(Row(n))) } \\ Andrew Howroyd, Mar 25 2020

Formula

T(n,k) = A001221(A063008(n,k)). - Andrew Howroyd, Mar 25 2020
a(n) = A001222(A129129(n)). - Gus Wiseman, May 24 2020

Extensions

Offset changed and terms a(50) and beyond from Andrew Howroyd, Mar 25 2020

A207380 Total area of the shadows of the three views of a three-dimensional version of the shell model of partitions with n shells.

Original entry on oeis.org

0, 3, 10, 21, 42, 70, 122, 187, 298, 443, 667, 957, 1401, 1960, 2775, 3828, 5295, 7167, 9745, 12998, 17380, 22915, 30196, 39347, 51274, 66126, 85209, 108942, 139055, 176273, 223148, 280733, 352623, 440646, 549597, 682411, 845852, 1044084, 1286512, 1579582
Offset: 0

Views

Author

Omar E. Pol, Feb 17 2012

Keywords

Comments

In this model each part of a partition can be represented by a cuboid of size 1 x 1 x L, where L is the size of the part. One of the views is a rectangle formed by ones whose area is n*A000041(n) = A066186(n). Each element of the first view is equal to the volume of a horizontal column parallel to the axis x. The second view is the n-th slice illustrated in A026792 which has A000041(n) levels and its area is A006128(n) equals the total number of parts of all partitions of n and equals the sum of largest parts of all partitions of n. Each zone contains a partition of n. Each element of the second view is equal to the volume of a horizontal column parallel to the axis y. The third view is a triangle because it is also the n-th slice of the tetrahedron of A209655. The area of triangle is A000217(n). Each element of the third view is equal to the volume of a vertical column parallel to the axis z. The sum of elements of each view is A066186(n) equals the area of the first view. For more information about the shell model of partitions see A135010 and A182703.

Examples

			For n = 5 the three views of the three-dimensional shell model of partitions with 5 shells look like this:
.
.   A066186(5) = 35     A006128(5) = 20
.
.         1 1 1 1 1     5
.         1 1 1 1 1     3 2
.         1 1 1 1 1     4 1
.         1 1 1 1 1     2 2 1
.         1 1 1 1 1     3 1 1
.         1 1 1 1 1     2 1 1 1
.         1 1 1 1 1     1 1 1 1 1
.
.
.         7 6 4 2 1
.           1 2 3 2
.             1 1 2
.               1 1
.                 1
.
.   A000217(5) = 15
.
The areas of the shadows of the three views are A066186(5) = 35, A006128(5) = 20 and A000217(5) = 15, therefore the total area of the three shadows is 35+20+15 = 70, so a(5) = 70.
		

Crossrefs

Programs

  • Maple
    b:= proc(n, i) option remember; local f, g;
          if n=0 or i=1 then [1, n]
        else f:= b(n, i-1); g:= `if`(i>n, [0, 0], b(n-i, i));
             [f[1]+g[1], f[2]+g[2]+g[1]]
          fi
        end:
    a:= n-> n*b(n, n)[1] +b(n, n)[2] +n*(n+1)/2:
    seq (a(n), n=0..50);  # Alois P. Heinz, Mar 22 2012
  • Mathematica
    b[n_, i_] := b[n, i] = Module[{f, g}, If [n == 0 || i == 1, {1, n}, f = b[n, i-1]; g = If[i>n, {0, 0}, b[n-i, i]]; Join[f[[1]] + g[[1]], f[[2]] + g[[2]] + g[[1]] ]]]; a[n_] := n*b[n, n][[1]] + b[n, n][[2]] + n*(n+1)/2; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Jun 18 2015, after Alois P. Heinz *)

Formula

a(n) = n * A000041(n) + A000217(n) + A006128(n) = A066186(n) + A000217(n) + A006128(n).

Extensions

More terms from Alois P. Heinz, Mar 22 2012

A196931 Triangle read by rows in which row n lists in nondecreasing order the smallest part of every partition of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 4, 1, 1, 1, 1, 1, 2, 5, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0

Views

Author

Omar E. Pol, Oct 21 2011

Keywords

Comments

If n >= 1, row n lists the smallest parts of every partition of n in the order produced by the shell model of partitions of A135010, hence row n lists the parts of the last section of the set of partitions of n, except the emergent parts (See A182699).
Row n has length A000041(n). Row sums give A046746. Right border of triangle gives A001477. Row n starts with A000041(n-1) ones, n >= 1.

Examples

			Written as a triangle:
  0,
  1,
  1,2,
  1,1,3,
  1,1,1,2,4,
  1,1,1,1,1,2,5,
  1,1,1,1,1,1,1,2,2,3,6
  1,1,1,1,1,1,1,1,1,1,1,2,2,3,7,
  1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,3,4,8,
  ...
		

Crossrefs

A333486 Length of the n-th reversed integer partition in graded reverse-lexicographic order. Partition lengths of A228531.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 3, 1, 2, 2, 3, 4, 1, 2, 2, 3, 3, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 4, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 5, 6, 7, 1, 2, 2, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 6, 7, 8, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 7, 8, 9
Offset: 0

Views

Author

Gus Wiseman, May 23 2020

Keywords

Examples

			Triangle begins:
  0
  1
  1 2
  1 2 3
  1 2 2 3 4
  1 2 2 3 3 4 5
  1 2 2 3 2 3 3 4 4 5 6
  1 2 2 3 2 3 3 4 3 4 4 5 5 6 7
  1 2 2 2 3 3 4 2 3 3 4 3 4 4 5 4 5 5 6 6 7 8
		

Crossrefs

Row lengths are A000041.
The generalization to compositions is A000120.
Row sums are A006128.
The same partition has sum A036042.
The length-sensitive version (sum/length/revlex) is A036043.
The colexicographic version (sum/colex) is A049085.
The same partition has minimum A182715.
The lexicographic version (sum/lex) is A193173.
The tetrangle of these partitions is A228531.
The version for non-reversed partitions is A238966.
The same partition has Heinz number A334436.
Reversed partitions in Abramowitz-Stegun order (sum/length/lex) are A036036.
Partitions in lexicographic order (sum/lex) are A193073.
Partitions in colexicographic order (sum/colex) are A211992.
Partitions in opposite Abramowitz-Stegun order (sum/length/revlex) are A334439.

Programs

  • Mathematica
    revlexsort[f_,c_]:=OrderedQ[PadRight[{c,f}]];
    Table[Length/@Sort[Reverse/@IntegerPartitions[n],revlexsort],{n,0,8}]

A209655 Tetrahedron in which the n-th slice is also one of the three views of the shell model of partitions of A207380 with n shells.

Original entry on oeis.org

1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 5, 4, 1, 2, 2, 1, 1, 2, 1, 1, 7, 6, 1, 4, 2, 1, 2, 3, 1, 1, 1, 2, 2, 1, 1
Offset: 1

Views

Author

Omar E. Pol, Mar 25 2012

Keywords

Comments

Each slice of the tetrahedron is a triangle, thus the number of elements in the n-th slice is A000217(n). The slices are perpendicular to the slices of A026792. Each element of the n-th slice equals the volume of a column of the shell model of partitions with n shells. The sum of each row of the n-th slice is A000041(n). The sum of all elements of the n-th slice is A066186(n).
It appears that the triangle formed by the last row of each slice gives A008284 and A058398.
It appears that the triangle formed by the first column of each slice gives A058399.
Also consider a vertical rectangle on the infinite square grid with shorter side = n and longer side = p(n) = A000041(n). Each row of rectangle represents a partition of n. Each part of each partition of n is a horizontal rectangle with shorter side = 1 and longer side = k, where k is the size of the part. It appears that T(n,k,j) is also the number of k-th parts of all partitions of n in the j-th column of rectangle.

Examples

			--------------------------------------------------------
Illustration of first five
slices of the tetrahedron                       Row sum
--------------------------------------------------------
. 1,                                               1
.    2,                                            2
.    1, 1,                                         2
.          3,                                      3
.          2, 1,                                   3
.          1, 1, 1,                                3
.                   5,                             5
.                   4, 1,                          5
.                   2, 2, 1,                       5
.                   1, 2, 1, 1,                    5
.                               7,                 7
.                               6, 1,              7
.                               4, 2, 1,           7
.                               2, 3, 1, 1,        7
.                               1, 2, 2, 1, 1,     7
--------------------------------------------------------
. 1, 3, 1, 6, 2, 1,12, 5, 2, 1,20, 8, 4, 2, 1,
.
Written as a triangle begins:
1;
2, 1, 1;
3, 2, 1, 1, 1, 1;
5, 4, 1, 2, 2, 1, 1, 2, 1, 1;
7, 6, 1, 4, 2, 1, 2, 3, 1, 1, 1, 2, 2, 1, 1;
In which row sums give A066186.
		

Crossrefs

Column sums give A181187. Main diagonal gives A210765. Another version is A209918.

A209918 Tetrahedron in which the n-th slice is also one of the three views of the shell model of partitions of A207380 with n shells.

Original entry on oeis.org

1, 2, 1, 1, 3, 2, 1, 1, 1, 1, 5, 4, 2, 1, 1, 2, 2, 1, 1, 1, 7, 6, 4, 2, 1, 1, 2, 3, 2, 1, 1, 2, 1, 1, 1
Offset: 1

Views

Author

Omar E. Pol, Mar 26 2012

Keywords

Comments

Each slice of the tetrahedron is a triangle, thus the number of elements in the n-th slice is A000217(n). The slices are perpendicular to the slices of A026792. Each element of the n-th slice equals the volume of a column of the shell model of partitions with n shells. The sum of each column of the n-th slice is A000041(n). The sum of all elements of the n-th slice is A066186(n).
It appears that the triangle formed by the first row of each slice gives A058399.
It appears that the triangle formed by the last column of each slice gives A008284 and A058398.
Also consider a vertical rectangle on the infinite square grid with shorter side = n and longer side = p(n) = A000041(n). Each row of rectangle represents a partition of n. Each part of each partition of n is a horizontal rectangle with shorter side = 1 and longer side = k, where k is the size of the part. It appears that T(n,k,j) is also the number of k-th parts of all partitions of n in the j-th column of rectangle.

Examples

			---------------------------------------------------------
Illustration of first five                       A181187
slices of the tetrahedron                        Row sum
---------------------------------------------------------
. 1,                                                1
.    2, 1,                                          3
.       1,                                          1
.          3, 2, 1                                  6
.             1, 1,                                 2
.                1,                                 1
.                   5, 4, 2, 1,                    12
.                      1, 2, 2,                     5
.                         1, 1                      2
.                            1,                     1
.                               7, 6, 4, 2, 1,     20
.                                  1, 2, 3, 2,      8
.                                     1, 1, 2,      4
.                                        1, 1,      2
.                                           1,      1
--------------------------------------------------------
. 1, 2, 2, 3, 3, 3, 5, 5, 5, 5, 7, 7, 7, 7, 7,
.
Note that the 5th slice appears as one of three views of the model in the example section of A207380.
		

Crossrefs

Row sums give A181187. Column sums give A209656. Main diagonal gives A210765. Another version is A209655.
Showing 1-9 of 9 results.