A141285 -id:A141285 - cp's OEIS frontend

A194809 Imbalance of the sum of largest parts of all partitions of n.

0, -2, 1, -5, 3, -12, 7, -25, 17, -47, 36, -88, 69, -155, 133, -262, 240, -439, 415, -717, 705, -1142, 1165, -1803, 1874, -2797, 2975, -4276, 4632, -6478, 7094, -9698, 10741, -14355, 16059, -21079, 23719, -30670, 34716, -44243, 50315, -63372

Offset: 1

Omar E. Pol, Feb 02 2012

sign

Consider the three-dimensional structure of the shell model of partitions version "tree". Note that only the larges parts > 1 produce the imbalance. Note that every column where is located a largest part contains largest parts of the same size, thesame as a periodic table (see example). For more information see A135010.

			For n = 6 the illustration of the shell model with 6 shells shows an imbalance of largest parts (see below):
------------------------------------------------------
Partitions                Tree             Table 1.0
of 6.                    A194805            A135010
------------------------------------------------------
6                   6                     6 . . . . .
3+3                   3                   3 . . 3 . .
4+2                     4                 4 . . . 2 .
2+2+2                     2               2 . 2 . 2 .
5+1                         1   5         5 . . . . 1
3+2+1                       1 3           3 . . 2 . 1
4+1+1                   4   1             4 . . . 1 1
2+2+1+1                   2 1             2 . 2 . 1 1
3+1+1+1                     1 3           3 . . 1 1 1
2+1+1+1+1                 2 1             2 . 1 1 1 1
1+1+1+1+1+1                 1             1 1 1 1 1 1
------------------------------------------------------
The sum of largest parts > 1 on the left hand side is 23 and the sum of largest parts > 1 on the right hand side is 11, so a(6) = -23 + 11 = -12. On the other hand for n = 6 we have that 0 together with the first n-1 terms > 1 of A138137 are 0, 2, 3, 6, 8, 15 so a(6) = 0-2+3-6+8-15 = -12.

Cf. A135010, A138121, A138137, A141285, A194795-A194797, A194805.

a(n) = Sum_{k=2..n} (-1)^(k-1)*A138137(k), n >= 2.

A210765 Triangle read by rows in which row n lists the number of partitions of n together with n-1 ones.

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 5, 1, 1, 1, 7, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 1, 22, 1, 1, 1, 1, 1, 1, 1, 30, 1, 1, 1, 1, 1, 1, 1, 1, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 101, 1, 1, 1

Offset: 1

Omar E. Pol, Mar 26 2012

The sum of row n is S_n = n - 1 + A000041(n) = A133041(n) - 1.

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) is also the number of k-th parts of all partitions of n in the k-th column of rectangle.

			Triangle begins:
1;
2,  1;
3,  1, 1;
5,  1, 1, 1;
7,  1, 1, 1, 1;
11, 1, 1, 1, 1, 1;
15, 1, 1, 1, 1, 1, 1;
22, 1, 1, 1, 1, 1, 1, 1;
30, 1, 1, 1, 1, 1, 1, 1, 1;
42, 1, 1, 1, 1, 1, 1, 1, 1, 1;

Main diagonal of A209655 and of A209918.

Cf. A000041, A008284, A058399, A133041, A135010, A141285, A209656, A207380.

A210943 Square array read by antidiagonals in which row n lists the parts of the infinite n-th zone of the shell model of partitions, in nonincreasing order.

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 2, 1, 1, 1, 4, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 1, 1

Offset: 1

Omar E. Pol, Apr 19 2012

The n-th zone of the shell model of partitions is formed by the parts of the n-th row of triangle A210941 together with infinitely many parts of size 1.

			Array begins:
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
2, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
3, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
2, 2, 1, 1, 1, 1, 1, 1, 1, 1,...
4, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
3, 2, 1, 1, 1, 1, 1, 1, 1, 1,...
5, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
2, 2, 2, 1, 1, 1, 1, 1, 1, 1,...
4, 2, 1, 1, 1, 1, 1, 1, 1, 1,...
3, 3, 1, 1, 1, 1, 1, 1, 1, 1,...
6, 1, 1, 1, 1, 1, 1, 1, 1, 1,...
3, 2, 2, 1, 1, 1, 1, 1, 1, 1,...
5, 2, 1, 1, 1, 1, 1, 1, 1, 1,...
4, 3, 1, 1, 1, 1, 1, 1, 1, 1,...
7, 1, 1, 1, 1, 1, 1, 1, 1, 1,...

Omar E. Pol, Illustration of the partitions and regions of n, for n = 1..12

Column 1 is A141285.

Cf. A135010, A138121, A182742, A182743, A210941, A210942.

A225596 Sum of largest parts of all partitions of n plus n. Also, total number of parts in all partitions of n plus n.

Original entry on oeis.org

0, 2, 5, 9, 16, 25, 41, 61, 94, 137, 202, 286, 411, 569, 794, 1083, 1479, 1982, 2662, 3517, 4650, 6073, 7921, 10229, 13198, 16876, 21548, 27321, 34573, 43482, 54593, 68166, 84959, 105399, 130496, 160911, 198050, 242849, 297239, 362626, 441586, 536145

Offset: 0

Omar E. Pol, Aug 01 2013

nonn

a(n) is also the number of horizontal toothpicks (or the total length of all horizontal boundary segments) in the diagram of regions of the set of partitions of n, see example. A093694(n) is the number of vertical toothpicks in the diagram. See also A225610. For a minimalist version of the diagram see A211978. For the definition of "region" see A206437.

			For n = 7 the sum of largest parts of all partitions of 7 plus 7 is (7+4+5+3+6+3+4+2+5+3+4+2+3+2+1) + 7 = 54 + 7 = 61. On the other hand the number of toothpicks in horizontal direction in the diagram of regions of the set of partitions of 7 is equal to 61, so a(7) = 61.
.
.                  Diagram of regions       Horizontal
Partitions         and partitions of 7      toothpicks
of 7
.                     _ _ _ _ _ _ _
7                    |_ _ _ _      |             7
4+3                  |_ _ _ _|_    |             4
5+2                  |_ _ _    |   |             5
3+2+2                |_ _ _|_ _|_  |             3
6+1                  |_ _ _      | |             6
3+3+1                |_ _ _|_    | |             3
4+2+1                |_ _    |   | |             4
2+2+2+1              |_ _|_ _|_  | |             2
5+1+1                |_ _ _    | | |             5
3+2+1+1              |_ _ _|_  | | |             3
4+1+1+1              |_ _    | | | |             4
2+2+1+1+1            |_ _|_  | | | |             2
3+1+1+1+1            |_ _  | | | | |             3
2+1+1+1+1+1          |_  | | | | | |             2
1+1+1+1+1+1+1        |_|_|_|_|_|_|_|             1
.                                                7
.                                              _____
.                                       Total   61
.

Cf. A000041, A006128, A093694, A135010, A139250, A141285, A186114, A194446, A194447, A206437, A211978, A220517, A225600, A225610.

a(n) = A006128(n) + n = A225610(n) - A093694(n).

a(n) = n + sum_{k=1..A000041(n)} A141285(k), n >= 1.

A225598 Triangle read by rows: T(n,k) = sum of all parts of all regions of the set of partitions of n whose largest part is k.

Original entry on oeis.org

1, 1, 3, 1, 3, 5, 1, 5, 5, 9, 1, 5, 8, 9, 12, 1, 7, 11, 15, 12, 20, 1, 7, 14, 19, 19, 20, 25, 1, 9, 17, 29, 24, 33, 25, 38, 1, 9, 23, 33, 36, 42, 39, 38, 49, 1, 11, 26, 47, 46, 61, 49, 61, 49, 69, 1, 11, 32, 55, 63, 76, 70, 76, 76, 69, 87, 1, 13, 38, 73, 78, 110, 87, 111, 95, 108, 87, 123

Offset: 1

Omar E. Pol, Aug 02 2013

For the definition of region see A206437.

T(n,k) is also the sum of all parts that end in the k-th column of the diagram of regions of the set of partitions of n (see Example section).

			For n = 5 and k = 3 the set of partitions of 5 contains two regions whose largest part is 3, they are third region which contains three parts [3, 1, 1] and the sixth region which contains only one part [3]. Therefore the sum of all parts is 3 + 1 + 1 + 3 = 8, so T(5,3) = 8.
.
.    Diagram    Illustration of parts ending in column k:
.    for n=5      k=1   k=2     k=3       k=4        k=5
.   _ _ _ _ _                                  _ _ _ _ _
.  |_ _ _    |                _ _ _           |_ _ _ _ _|
.  |_ _ _|_  |               |_ _ _|  _ _ _ _       |_ _|
.  |_ _    | |          _ _          |_ _ _ _|        |_|
.  |_ _|_  | |         |_ _|  _ _ _      |_ _|        |_|
.  |_ _  | | |          _ _  |_ _ _|       |_|        |_|
.  |_  | | | |      _  |_ _|     |_|       |_|        |_|
.  |_|_|_|_|_|     |_|   |_|     |_|       |_|        |_|
.
k = 1 2 3 4 5
.
The 5th row lists:  1     5       8         9         12
.
Triangle begins:
1;
1,  3;
1,  3,  5;
1,  5,  5,  9;
1,  5,  8,  9, 12;
1,  7, 11, 15, 12,  20;
1,  7, 14, 19, 19,  20, 25;
1,  9, 17, 29, 24,  33, 25,  38;
1,  9, 23, 33, 36,  42, 39,  38, 49;
1, 11, 26, 47, 46,  61, 49,  61, 49,  69;
1, 11, 32, 55, 63,  76, 70,  76, 76,  69, 87;
1, 13, 38, 73, 78, 110, 87, 111, 95, 108, 87, 123;

Column 1 is A000012. Column 2 are the numbers >= 3 of A109613. Row sums give A066186. Right border gives A046746. Second right border gives A046746.

Cf. A000041, A066186, A135010, A141285, A186114, A186412, A187219, A194446, A206437, A207779, A211978, A225597, A225600, A225610.

A228368 Difference between the n-th element of the ruler function and the highest power of 2 dividing n.

Original entry on oeis.org

0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -11, 0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -26, 0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -11, 0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -57, 0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -11, 0, 0, 0, -1, 0, 0, 0, -4, 0, 0, 0, -1, 0, 0, 0, -26

Offset: 1

Omar E. Pol, Aug 22 2013

Also rank of the n-th region of the diagram of compositions of j, if 1 <= n <= 2^(j-1), see example.
Here the rank of a region is defined as the largest part minus the number of parts (similar to the Dyson's rank of a partition).
The equivalent sequence for integer partitions is A194447.
Also triangle read by rows in which T(j,k) is the rank of the k-th region of the j-th section of the set of compositions in colexicographic order of any integer >= j. See A228366.

			Illustration of initial terms (n = 1..16):
-----------------------------------------------
.                  Largest     Number of
.    Diagram of    part of     parts of
.   compositions   region n    region n
-----------------------------------------------
n                 A001511(n)  A006519(n)  a(n)
-----------------------------------------------
.
1     _| | | | |      1           1         0
2     _ _| | | |      2           2         0
3     _|   | | |      1           1         0
4     _ _ _| | |      3           4        -1
5     _| |   | |      1           1         0
6     _ _|   | |      2           2         0
7     _|     | |      1           1         0
8     _ _ _ _| |      4           8        -4
9     _| | |   |      1           1         0
10    _ _| |   |      2           2         0
11    _|   |   |      1           1         0
12    _ _ _|   |      3           4        -1
13    _| |     |      1           1         0
14    _ _|     |      2           2         0
15    _|       |      1           1         0
16    _ _ _ _ _|      5          16       -11
.
Written as an array read by rows with four columns the first three columns contain only zeros.
  0,   0,   0,  -1;
  0,   0,   0,  -4;
  0,   0,   0,  -1;
  0,   0,   0, -11;
  0,   0,   0,  -1;
  0,   0,   0,  -4;
  0,   0,   0,  -1;
  0,   0,   0, -26;
  ...
Written as a triangle T(j,k) the sequence begins:
  0;
  0;
  0,-1;
  0,0,0,-4;
  0,0,0,-1,0,0,0,-11;
  0,0,0,-1,0,0,0,-4,0,0,0,-1,0,0,0,-26;
  0,0,0,-1,0,0,0,-4,0,0,0,-1,0,0,0,-11,0,0,0,-1,0,0,0,-4,0, 0,0,-1,0,0,0,-57;
  ...
Row lengths give A011782.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A001511, A006519, A011782, A141285, A194446, A194447, A228366, A228367, A228525.

def A228368(n): return (m:=n&-n).bit_length()-m # Chai Wah Wu, Jul 14 2022

a(n) = A001511(n) - A006519(n).

a(4n-3) = a(4n-2) = a(4n-1) = 0. a(4n) = A001511(4n) - A006519(4n).

A244966 Triangle read by rows: T(n,k) is the difference between the largest and the smallest part of the k-th partition in the list of colexicographically ordered partitions of n, with n>=1 and 1<=k<=p(n), where p(n) is the number of partitions of n.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Jul 18 2014

The number of t's in row n gives A097364(n,t), with n>=1 and 0<=t

Rows converge to A244967, which is A141285 - 1.

Row n has length A000041(n).

Row sums give A116686.

			Triangle begins:
0;
0, 0;
0, 1, 0;
0, 1, 2, 0, 0;
0, 1, 2, 1, 3, 1, 0;
0, 1, 2, 1, 3, 2, 4, 0, 2, 0, 0;
0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 1, 3, 1, 0;
0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 2, 4, 3, 6, 0, 2, 1, 4, 2, 0, 0;
...
For n = 6 we have:
--------------------------------------------------------
.                        Largest  Smallest   Difference
k    Partition of 6        part     part       T(6,k)
--------------------------------------------------------
1:  [1, 1, 1, 1, 1, 1]      1    -    1     =     0
2:  [2, 1, 1, 1, 1]         2    -    1     =     1
3:  [3, 1, 1, 1]            3    -    1     =     2
4:  [2, 2, 1, 1]            2    -    1     =     1
5:  [4, 1, 1]               4    -    1     =     3
6:  [3, 2, 1]               3    -    1     =     2
7:  [5, 1]                  5    -    1     =     4
8:  [2, 2, 2]               2    -    2     =     0
9:  [4, 2]                  4    -    2     =     2
10: [3, 3]                  3    -    3     =     0
11: [6]                     6    -    6     =     0
--------------------------------------------------------
So the 6th row of triangle is [0,1,2,1,3,2,4,0,2,0,0] and the row sum is A116686(6) = 15.
Note that in the 6th row there are four 0's so A097364(6,0) = 4, there are two 1's so A097364(6,1) = 2, there are three 2's so A097364(6,2) = 3, there is only one 3 so A097364(6,3) = 1, there is only one 4 so A097364(6,4) = 1 and there are no 5's so A097364(6,5) = 0.

G. E. Andrews, M. Beck and N. Robbins, Partitions with fixed differences between largest and smallest parts, arXiv:1406.3374 [math.NT], 2014

Cf. A000005, A000041, A008805, A049820, A097364, A116686, A128508, A135010, A141285, A196931, A218567-A218573, A244967.

T(n,k) = A141285(k) - A196931(n,k), n>=1, 1<=k<=A000041(n).

A299473 a(n) = 3*p(n), where p(n) is the number of partitions of n.

Original entry on oeis.org

3, 3, 6, 9, 15, 21, 33, 45, 66, 90, 126, 168, 231, 303, 405, 528, 693, 891, 1155, 1470, 1881, 2376, 3006, 3765, 4725, 5874, 7308, 9030, 11154, 13695, 16812, 20526, 25047, 30429, 36930, 44649, 53931, 64911, 78045, 93555, 112014, 133749, 159522, 189783, 225525, 267402, 316674, 374262, 441819, 520575, 612678

Offset: 0

Omar E. Pol, Feb 10 2018

nonn

For n >= 1, a(n) is also the number of vertices in the minimalist diagram of partitions of n, in which A139582(n) is the number of line segments and A000041(n) is the number of open regions (see example).

			Construction of a minimalist version of a modular table of partitions in which a(n) is the number of vertices of the diagram after n-th stage (n = 1..6):
-----------------------------------------------------------------------------------
n.........:    1     2       3         4           5           6   (stage)
A000041(n):    1     2       3         5           7          11   (open regions)
A139582(n):    2     4       6        10          14          22   (line segments)
a(n)......:    3     6       9        15          21          33   (vertices)
-----------------------------------------------------------------------------------
r     p(n)
-----------------------------------------------------------------------------------
.
1 .... 1 .... _|   _| |   _| | |   _| | | |   _| | | | |   _| | | | | |
2 .... 2 ......... _ _|   _ _| |   _ _| | |   _ _| | | |   _ _| | | | |
3 .... 3 ................ _ _ _|   _ _ _| |   _ _ _| | |   _ _ _| | | |
4                                  _ _|   |   _ _|   | |   _ _|   | | |
5 .... 5 ......................... _ _ _ _|   _ _ _ _| |   _ _ _ _| | |
6                                             _ _ _|   |   _ _ _|   | |
7 .... 7 .................................... _ _ _ _ _|   _ _ _ _ _| |
8                                                          _ _|   |   |
9                                                          _ _ _ _|   |
10                                                         _ _ _|     |
11 .. 11 ................................................. _ _ _ _ _ _|
.
The r-th horizontal line segment has length A141285(r).
The r-th vertical line segment has length A194446(r).
An infinite diagram is a minimalist table of all partitions of all positive integers.

Shawn A. Broyles, Table of n, a(n) for n = 0..1000

k times partition numbers: A000041 (k=1), A139582 (k=2), this sequence (k=3), A299474 (k=4).

Cf. A135010, A141285, A182181, A186114, A193870, A194446, A194447, A206437, A207779, A220482, A220517, A273140, A278355, A278602, A299475.

a(n) = 3*A000041(n) = A000041(n) + A139582(n).

a(n) = A299475(n) - 1, n >= 1.

A299774 Irregular triangle read by rows in which row n lists the indices of the partitions into equal parts in the list of colexicographically ordered partitions of n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 5, 1, 7, 1, 8, 10, 11, 1, 15, 1, 16, 21, 22, 1, 27, 30, 1, 31, 41, 42, 1, 56, 1, 57, 69, 73, 76, 77, 1, 101, 1, 102, 134, 135, 1, 160, 172, 176, 1, 177, 221, 230, 231, 1, 297, 1, 298, 353, 380, 384, 385, 1, 490, 1, 491, 604, 615, 626, 627, 1

Offset: 1

Omar E. Pol, Mar 29 2018

Note that n is one of the partitions of n into equal parts.
If n is even then row n ending in [p(n) - 1, p(n)], where p(n) = A000041(n).
T(n,k) > p(n - 1), if 1 < k <= A000005(n).
Removing the 1's then all terms of the sequence are in increasing order.
If n is even then row n starts with [1, p(n - 1) + 1]. - David A. Corneth and Omar E. Pol, Aug 26 2018

			Triangle begins:
  1;
  1,   2;
  1,   3;
  1,   4,   5;
  1,   7;
  1,   8,  10,  11;
  1,  15;
  1,  16,  21,  22;
  1,  27,  30;
  1,  31,  41,  42;
  1,  56;
  1,  57,  69,  73,  76,  77;
  1, 101;
  1, 102, 134, 135;
  1, 160, 172, 176;
  ...
For n = 6 the partitions of 6 into equal parts are [1, 1, 1, 1, 1, 1], [2, 2, 2], [3, 3] and [6]. Then we have that in the list of colexicographically ordered partitions of 6 these partitions are in the rows 1, 8, 10 and 11 respectively as shown below, so the 6th row of the triangle is [1, 8, 10, 11].
-------------------------------------------------------------
   p      Diagram        Partitions of 6
-------------------------------------------------------------
        _ _ _ _ _ _
   1   |_| | | | | |    [1, 1, 1, 1, 1, 1]  <--- equal parts
   2   |_ _| | | | |    [2, 1, 1, 1, 1]
   3   |_ _ _| | | |    [3, 1, 1, 1]
   4   |_ _|   | | |    [2, 2, 1, 1]
   5   |_ _ _ _| | |    [4, 1, 1]
   6   |_ _ _|   | |    [3, 2, 1]
   7   |_ _ _ _ _| |    [5, 1]
   8   |_ _|   |   |    [2, 2, 2]  <--- equal parts
   9   |_ _ _ _|   |    [4, 2]
  10   |_ _ _|     |    [3, 3]  <--- equal parts
  11   |_ _ _ _ _ _|    [6]  <--- equal parts
.

Row n has length A000005(n).
Right border gives A000041, n >= 1.
Column 1 gives A000012.
Records give A317296.
Cf. A211992 (partitions in colexicographic order).
Cf. A027750, A135010, A141285, A186114, A186412, A193870, A194446, A194447, A211978, A206437, A299474, A299475, A299773, A299775.

row(n) = {if(n == 1, return([1])); my(nd = numdiv(n), res = vector(nd)); res[1] = 1; res[nd] = numbpart(n); if(nd > 2, t = nd - 1; p = vecsort(partitions(n)); forstep(i = #p - 1, 2, -1, if(p[i][1] == p[i][#p[i]], res[t] = i; t--; if(t==1, return(res)))), return(res))} \\ David A. Corneth, Aug 17 2018

Terms a(46) and beyond from David A. Corneth, Aug 16 2018

A182718 Largest part of the n-th row of the diagram of another version of the shell model of partitions in which each last section of partitions is represented by a tree.

Original entry on oeis.org

1, 2, 3, 4, 2, 5, 3, 6, 3, 4, 2, 7, 4, 5, 3, 8, 4, 5, 6, 3, 4, 2, 9, 5, 6, 3, 7, 4, 5, 3

Offset: 1

Omar E. Pol, Jan 26 2011

The same positive integers of the triangle of A141285 but here each row lists the terms in reverse order.
It appears that the version of the shell model of partitions which gives this sequence also shows a connection between the partition theory and the graph theory because the structure looks like a forest or grove in which each last section is a tree. In a three-dimensional version of the structure we can see that one of the views shows the branches of the trees of the even numbers tilted 45 degrees to the left and the branches of the trees of the odd numbers tilted 45 degrees to the right. Another view contains the "roots" of trees, the tables of both A182982 and A182983.
I would like a table for this sequence!
I would like to see the graphic!

			Triangle begins:
1,
2,
3,
4, 2,
5, 3,
6, 3, 4, 2,
7, 4, 5, 3,
8, 4, 5, 6, 3, 4, 2,
9, 5, 6, 3, 7, 4, 5, 3,

Cf. A135010, A138121, A141285, A182742, A182743, A182982, A182983.

Column 1 gives A000027.

Previous Showing 71-80 of 96 results. Next

cp's OEIS Frontend

A194809 Imbalance of the sum of largest parts of all partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A210765 Triangle read by rows in which row n lists the number of partitions of n together with n-1 ones.

Views

Author

Keywords

Comments

Examples

Crossrefs

A210943 Square array read by antidiagonals in which row n lists the parts of the infinite n-th zone of the shell model of partitions, in nonincreasing order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A225596 Sum of largest parts of all partitions of n plus n. Also, total number of parts in all partitions of n plus n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A225598 Triangle read by rows: T(n,k) = sum of all parts of all regions of the set of partitions of n whose largest part is k.

Views

Author

Keywords

Comments

Examples

Crossrefs

A228368 Difference between the n-th element of the ruler function and the highest power of 2 dividing n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Formula

A244966 Triangle read by rows: T(n,k) is the difference between the largest and the smallest part of the k-th partition in the list of colexicographically ordered partitions of n, with n>=1 and 1<=k<=p(n), where p(n) is the number of partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A299473 a(n) = 3*p(n), where p(n) is the number of partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A299774 Irregular triangle read by rows in which row n lists the indices of the partitions into equal parts in the list of colexicographically ordered partitions of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Extensions

A182718 Largest part of the n-th row of the diagram of another version of the shell model of partitions in which each last section of partitions is represented by a tree.

Views