A194447 -id:A194447 - cp's OEIS frontend

A229946 Height of the peaks and the valleys in the Dyck path whose j-th ascending line segment has A141285(j) steps and whose j-th descending line segment has A194446(j) steps.

0, 1, 0, 2, 0, 3, 0, 2, 1, 5, 0, 3, 2, 7, 0, 2, 1, 5, 3, 6, 5, 11, 0, 3, 2, 7, 5, 9, 8, 15, 0, 2, 1, 5, 3, 6, 5, 11, 7, 12, 11, 15, 14, 22, 0, 3, 2, 7, 5, 9, 8, 15, 11, 14, 13, 19, 17, 22, 21, 30, 0, 2, 1, 5, 3, 6, 5, 11, 7, 12, 11, 15, 14, 22, 15, 19, 18, 25, 23, 29, 28, 33, 32, 42, 0

Offset: 0

Omar E. Pol, Nov 03 2013

Also 0 together the alternating sums of A220517.
The master diagram of regions of the set of partitions of all positive integers is a total dissection of the first quadrant of the square grid in which the j-th horizontal line segments has length A141285(j) and the j-th vertical line segment has length A194446(j). For the definition of "region" see A206437. The first A000041(k) regions of the diagram represent the set of partitions of k in colexicographic order (see A211992). The length of the j-th horizontal line segment equals the largest part of the j-th partition of k and equals the largest part of the j-th region of the diagram. The length of the j-th vertical line segment (which is the line segment ending in row j) equals the number of parts in the j-th region.
For k = 7, the diagram 1 represents the partitions of 7. The diagram 2 is a minimalist version of the structure which does not contain the axes [X, Y].  See below:
.
.  j     Diagram 1         Partitions           Diagram 2
.        _   _                            _   _  
. 15  |  _       |      7                   _        |
. 14  |  _ |    |      4+3                  _ |    |
. 13  |  _    |   |      5+2                  _    |   |
. 12  |  _| |_  |      3+2+2                _| |_  |
. 11  |  _      | |      6+1                  _      | |
. 10  |  _|    | |      3+3+1               _ |    | |
.  9  |     |   | |      4+2+1                   |   | |
.  8  | |_ |  | |      2+2+2+1             |_ |  | |
.  7  |  _    | | |      5+1+1                _    | | |
.  6  |  _|  | | |      3+2+1+1             _ |  | | |
.  5  |     | | | |      4+1+1+1                 | | | |
.  4  | |_  | | | |      2+2+1+1+1           |_  | | | |
.  3  |   | | | | |      3+1+1+1+1             | | | | |
.  2  |  | | | | | |      2+1+1+1+1+1          | | | | | |
.  1  |||_|||_|_|      1+1+1+1+1+1+1       | | | | | | |
.
.      1 2 3 4 5 6 7
.
The second diagram has the property that if the number of regions is also the number of partitions of k so the sum of the lengths of all horizontal line segment equals the sum of the lengths of all vertical line segments and equals A006128(k), for k >= 1.
Also the diagram has the property that it can be transformed in a Dyck path (see example).
The height of the peaks and the valleys of the infinite Dyck path give this sequence.
Q: Is this Dyck path a fractal?

			Illustration of initial terms (n = 0..21):
.                                                             11
.                                                             /
.                                                            /
.                                                           /
.                                   7                      /
.                                   /\                 6  /
.                     5            /  \           5    /\/
.                     /\          /    \          /\  / 5
.           3        /  \     3  /      \        /  \/
.      2    /\   2  /    \    /\/        \   2  /   3
.   1  /\  /  \  /\/      \  / 2          \  /\/
.   /\/  \/    \/ 1        \/              \/ 1
.  0 0   0     0           0               0
.
Note that the k-th largest peak between two valleys at height 0 is also A000041(k) and the next term is always 0.
.
Written as an irregular triangle in which row k has length 2*A187219(k), k >= 1, the sequence begins:
0,1;
0,2;
0,3;
0,2,1,5;
0,3,2,7;
0,2,1,5,3,6,5,11;
0,3,2,7,5,9,8,15;
0,2,1,5,3,6,5,11,7,12,11,15,14,22;
0,3,2,7,5,9,8,15,11,14,13,19,17,22,21,30;
0,2,1,5,3,6,5,11,7,12,11,15,14,22,15,19,18,25,23,29,28,33,32,42;
...

Omar E. Pol, Visualization of regions in a diagram for A006128

Column 1 is A000004. Right border gives A000041 for the positive integers.

Cf. A006128, A135010, A138137, A139582, A141285, A186412, A187219, A194446, A194447, A193870, A206437, A207779, A211009, A211978, A211992, A220517, A225600, A225610.

a(0) = 0; a(n) = a(n-1) + (-1)^(n-1)*A220517(n), n >= 1.

A233968 Number of steps between two valleys at height 0 in the infinite Dyck path in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1.

Original entry on oeis.org

2, 4, 6, 12, 16, 30, 38, 64, 84, 128, 166, 248, 314, 448, 576, 790, 1004, 1358, 1708, 2264, 2844, 3694, 4614, 5936, 7354, 9342, 11544, 14502, 17816, 22220, 27144, 33584, 40878, 50192, 60828, 74276, 89596, 108778, 130772, 157918, 189116, 227374

Offset: 1

Omar E. Pol, Jan 14 2014

nonn

Also first differences of A211978.

			Illustration of initial terms as a dissection of a minimalist diagram of regions of the set of partitions of n, for n = 1..6:
.                                         _ _ _ _ _ _
.                                         _ _ _      |
.                                         _ _ _|_    |
.                                         _ _    |   |
.                             _ _ _ _ _      |   |   |
.                             _ _ _    |             |
.                   _ _ _ _        |   |             |
.                   _ _    |           |             |
.           _ _ _      |   |           |             |
.     _ _        |         |           |             |
. _      |       |         |           |             |
.  |     |       |         |           |             |
.
. 2    4      6       12          16          30
.
Also using the elements from the above diagram we can draw an infinite Dyck path in which the n-th odd-indexed segment has A141285(n) up-steps and the n-th even-indexed segment has A194446(n) down-steps. Note that the n-th largest peak between two valleys at height 0 is also the partition number A000041(n).
7..................................
.                                 /\
5....................            /  \                /\
.                   /\          /    \          /\  /
3..........        /  \        /      \        /  \/
2.....    /\      /    \    /\/        \      /
1..  /\  /  \  /\/      \  /            \  /\/
0 /\/  \/    \/          \/              \/
.  2, 4,   6,       12,           16,...
.

Cf. A000041, A006128, A135010, A138137, A139582, A141285, A182699, A182709, A186412, A194446, A194447, A193870, A206437, A207779, A211009, A211978, A211992, A220517, A225600, A225610, A228109, A228110, A229946.

a(n) = 2*(A006128(n) - A006128(n-1)) = 2*A138137(n).

A182377 Total sum of positive ranks of all regions in the last shell of n.

Original entry on oeis.org

0, 0, 0, 1, 2, 5, 8, 14, 21, 32, 45, 67, 91

Offset: 1

Omar E. Pol, Apr 29 2012

The rank of a region of n is the largest part minus the number of parts. For the definition of "region of n" see A206437. For the definition of "last shell of n" see A135010.

a(n) is also the sum of positive integers in row n of triangle A194447. First differs from A000094 at a(12).

			For n = 7 the last shell of 7 contains four regions: [3],[5,2],[4],[7,3,2,2,1,1,1,1,1,1,1,1,1,1,1] so we have:
----------------------------------------------------------
.        Largest    Number
Region     part    of parts    Rank
----------------------------------------------------------
.  1        3         1          2
.  2        5         2          3
.  3        4         1          3
.  4        7        15         -8
.
The sum of positive ranks is a(7) = 2 + 3 + 3 = 8.

Omar E. Pol, Illustration of the seven regions of 5

Cf. A000094, A135010, A138121, A182699, A182709, A183152, A186114, A187219, A194436-A194439, A194447-A194448, A196025, A206437, A209616.

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.

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).

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

A194449 Largest part minus the number of parts > 1 in the n-th region of the set of partitions of j, if 1 <= n <= A000041(j).

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 2, 3, 3, 3, 1, 2, 2, 2, 4, 3, 1, 2, 3, 3, 3, 2, 4, 4, 1, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 3, 3, 3, 2, 4, 4, 1, 4, 3, 5, 6, 5, -3, 1, 2, 2, 2, 4, 3, 1, 3, 5, 5, 4, -2, 2, 4, 4, 5, 3, 6, 6, 5, -9

Offset: 1

Omar E. Pol, Dec 10 2011

Also triangle read by rows: T(j,k) = largest part minus the numbers of parts > 1 in the k-th region of the last section of the set of partitions of j. It appears that the sum of row j is equal to A000041(j-1). For the definition of "region" of the set of partitions of j see A206437. See also A135010.

			The 7th region of the shell model of partitions is [5, 2, 1, 1, 1, 1, 1]. The largest part is 5 and the number of parts > 1 is 2, so a(7) = 5 - 2 = 3 (see an illustration in the link section).
Written as an irregular triangle T(j,k) begins:
1;
1;
2;
1,2;
2,3;
1,2,2,2;
2,3,3,3;
1,2,2,2,4,3,1;
2,3,3,3,2,4,4,1;
1,2,2,2,4,3,1,3,5,5,4,-2;
2,3,3,3,2,4,4,1,4,3,5,6,5,-3;
1,2,2,2,4,3,1,3,5,5,4,-2,2,4,4,5,3,6,6,5,-9;

Omar E. Pol, Illustration of the seven regions of 5

Row j has length A187219(j).

Cf. A000041, A135010, A138121, A138137, A138879, A186114, A186412, A193870, A194436, A194437, A194438, A194439, A194446, A194447, A206437.

a(n) = A141285(n) - A194448(n).

A244968 Area between two valleys at height 0 under the infinite Dyck path related to partitions in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1, multiplied by 2.

Original entry on oeis.org

1, 4, 9, 28, 54, 151

Offset: 1

Omar E. Pol, Nov 08 2014

			For k = 6, the diagram 1 represents the partitions of 6. The diagram 2 is a minimalist version of the structure which does not contain the axes [X, Y], see below:
.
.  j     Diagram 1        Partitions          Diagram 2
.      _ _ _ _ _ _                           _ _ _ _ _ _
. 11  |_ _ _      |       6                  _ _ _      |
. 10  |_ _ _|_    |       3+3                _ _ _|_    |
.  9  |_ _    |   |       4+2                _ _    |   |
.  8  |_ _|_ _|_  |       2+2+2              _ _|_ _|_  |
.  7  |_ _ _    | |       5+1                _ _ _    | |
.  6  |_ _ _|_  | |       3+2+1              _ _ _|_  | |
.  5  |_ _    | | |       4+1+1              _ _    | | |
.  4  |_ _|_  | | |       2+2+1+1            _ _|_  | | |
.  3  |_ _  | | | |       3+1+1+1            _ _  | | | |
.  2  |_  | | | | |       2+1+1+1+1          _  | | | | |
.  1  |_|_|_|_|_|_|       1+1+1+1+1+1         | | | | | |
.
Then we use the elements from the above diagram to draw an infinite Dyck path in which the j-th odd-indexed segment has A141285(j) up-steps and the j-th even-indexed segment has A194446(j) down-steps.
For the illustration of initial terms we use two opposite Dyck paths, as shown below:
11 ...........................................................
.                                                            /\
.                                                           /
.                                                          /
7 ..................................                      /
.                                  /\                    /
5 ....................            /  \                /\/
.                    /\          /    \          /\  /
3 ..........        /  \        /      \        /  \/
2 .....    /\      /    \    /\/        \      /
1 ..  /\  /  \  /\/      \  /            \  /\/
0  /\/  \/    \/          \/              \/
.  \/\  /\    /\          /\              /\
.     \/  \  /  \/\      /  \            /  \/\
.   1      \/      \    /    \/\        /      \
.      4            \  /        \      /        \  /\
.           9        \/          \    /          \/  \
.                                 \  /                \/\
.                    28            \/                    \
.                                                         \
.                                  54                      \
.                                                           \
.                                                            \/
.
The diagram is infinite. Note that the n-th largest peak between two valleys at height 0 is also the partition number A000041(n).
Calculations:
a(1) = 1.
a(2) = 2^2 = 4.
a(3) = 3^2 = 9.
a(4) = 2^2-1^2+5^2 = 4-1+25 = 28.
a(5) = 3^2-2^2+7^2 = 9-4+49 = 54.
a(6) = 2^2-1^2+5^2-3^2+6^2-5^2+11^2 = 4-1+25-9+36-25+121 = 151.

Cf. A000041, A135010, A141285, A193870, A194446, A194447, A206437, A211009, A211978, A220517, A225600, A225610, A228109, A228110, A228350, A230440, A233968.

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

Original entry on oeis.org

1, 2, 2, 3, 5, 6, 7, 6, 11, 14, 15, 22, 25, 29, 30, 25, 42, 55, 56

Offset: 1

Omar E. Pol, Mar 29 2018

If n > 1 and n is odd then row n ending in [p(n) - 1, p(n)], where p(n) is A000041(n).

			Triangle begins:
   1;
   2;
   2,  3;
   5;
   6,  7;
   6, 11;
  14, 15;
  22;
  25, 29, 30;
  25, 42;
  55, 56;
...
For n = 9 the partitions of 9 into consecutive parts are [4, 3, 2], [5, 4] and [9]. Then we have that in the list of colexicographically ordered partitions of 9 these partitions are in the rows 25, 29 and 30 respectively as shown below, so the 9th row of the triangle is [25, 29, 30].
--------------------------------------------------------
   p         Diagram          Partitions of 9
--------------------------------------------------------
        1 2 3 4 5 6 7 8 9
        _ _ _ _ _ _ _ _ _
   1   |_| | | | | | | | |   [1, 1, 1, 1, 1, 1, 1, 1, 1]
   2   |_ _| | | | | | | |   [2, 1, 1, 1, 1, 1, 1, 1]
   3   |_ _ _| | | | | | |   [3, 1, 1, 1, 1, 1, 1]
   4   |_ _|   | | | | | |   [2, 2, 1, 1, 1, 1, 1]
   5   |_ _ _ _| | | | | |   [4, 1, 1, 1, 1, 1]
   6   |_ _ _|   | | | | |   [3, 2, 1, 1, 1, 1]
   7   |_ _ _ _ _| | | | |   [5, 1, 1, 1, 1]
   8   |_ _|   |   | | | |   [2, 2, 2, 1, 1, 1]
   9   |_ _ _ _|   | | | |   [4, 2, 1, 1, 1]
  10   |_ _ _|     | | | |   [3, 3, 1, 1, 1]
  11   |_ _ _ _ _ _| | | |   [6, 1, 1, 1]
  12   |_ _ _|   |   | | |   [3, 2, 2, 1, 1]
  13   |_ _ _ _ _|   | | |   [5, 2, 1, 1]
  14   |_ _ _ _|     | | |   [4, 3, 1, 1]
  15   |_ _ _ _ _ _ _| | |   [7, 1, 1]
  16   |_ _|   |   |   | |   [2, 2, 2, 2, 1]
  17   |_ _ _ _|   |   | |   [4, 2, 2, 1]
  18   |_ _ _|     |   | |   [3, 3, 2, 1]
  19   |_ _ _ _ _ _|   | |   [6, 2, 1]
  20   |_ _ _ _ _|     | |   [5, 3, 1]
  21   |_ _ _ _|       | |   [4, 4, 1]
  22   |_ _ _ _ _ _ _ _| |   [8, 1]
  23   |_ _ _|   |   |   |   [3, 2, 2, 2]
  24   |_ _ _ _ _|   |   |   [5, 2, 2]
  25   |_ _ _ _|     |   |   [4, 3, 2]   <--- Consecutive parts
  26   |_ _ _ _ _ _ _|   |   [7, 2]
  27   |_ _ _|     |     |   [3, 3, 3]
  28   |_ _ _ _ _ _|     |   [6, 3]
  29   |_ _ _ _ _|       |   [5, 4]   <--- Consecutive parts
  30   |_ _ _ _ _ _ _ _ _|   [9]   <--- Consecutive parts
.

Row n has length A001227(n).
Right border gives A000041, n >= 1.
Cf. A211992 (partitions in colexicographic order).
Cf. A299765 (partitions into consecutive parts).
For tables of partitions into consecutive parts see also A286000 and A286001.
Cf. A000041, A135010, A141285, A186114, A186412, A193870, A194446, A194447, A211978, A206437, A299474, A299475, A299773, A299774.

cp's OEIS Frontend

A229946 Height of the peaks and the valleys in the Dyck path whose j-th ascending line segment has A141285(j) steps and whose j-th descending line segment has A194446(j) steps.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A233968 Number of steps between two valleys at height 0 in the infinite Dyck path in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A182377 Total sum of positive ranks of all regions in the last shell of n.

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

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

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

A194449 Largest part minus the number of parts > 1 in the n-th region of the set of partitions of j, if 1 <= n <= A000041(j).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A244968 Area between two valleys at height 0 under the infinite Dyck path related to partitions in which the k-th ascending line segment has A141285(k) steps and the k-th descending line segment has A194446(k) steps, k >= 1, multiplied by 2.

Views

Author

Keywords

Examples

Crossrefs

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