cp's OEIS Frontend

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 = 5, the diagram 1 represents the partitions of 5. The diagram 2 shows separately the boundary segments southwest sides of the first seven regions of the diagram 1, see below:

.

j Diagram 1 Diagram 2

_

7 | _ | | _

6 | _| | | _ |

5 | | | | |

4 | |_ | | | |_ |

3 | | | | | | |

2 | | | | | | | | |

1 |||_||| | | | | |_

.

. 1 2 3 4 5

.

a(n) is the height after n-th step of an infinite staircase which is the lower part of a diagram of regions of the set of partitions of all positive integers. The upper part of the diagram is the infinite Dyck path mentioned in A228110. The diagram shows the shape of the successive regions of the set of partitions of all positive integers. The area of the n-th region is A186412(n).

For the height of the peaks and the valleys in the infinite Dyck path see A229946.

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 sequence gives the height of the infinite Dyck path after n-th step.

The absolute values of the first differences give A000012.

For the height of the peaks and the valleys in the infinite Dyck path see A229946.

Q: Is this infinite Dyck path a fractal?

Also first differences of A211978.