The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A336812 Irregular triangle read by rows T(n,k), n >= 1, k >= 1, in which row n is constructed replacing every term of row n of A336811 with its divisors. 22
 1, 1, 2, 1, 3, 1, 1, 2, 4, 1, 2, 1, 1, 5, 1, 3, 1, 2, 1, 1, 1, 2, 3, 6, 1, 2, 4, 1, 3, 1, 2, 1, 2, 1, 1, 1, 7, 1, 5, 1, 2, 4, 1, 3, 1, 3, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 4, 8, 1, 2, 3, 6, 1, 5, 1, 2, 4, 1, 2, 4, 1, 3, 1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 3, 9, 1, 7, 1, 2, 3, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Here we introduce a new type of table which shows the correspondence between divisors and partitions. More precisely the table shows the corresponce between all parts of the last section of the set of partitions of n and all divisors of all terms of the n-th row of A336811, with n >= 1. The mentionded parts and the mentioned divisors are the same numbers (see Example section). For an equivalent table showing the same kind of correspondence for all partitions of all positive integers see the supersequence A338156. LINKS EXAMPLE Triangle begins: [1]; [1, 2]; [1, 3], [1]; [1, 2, 4], [1, 2], [1]; [1, 5], [1, 3], [1, 2], [1], [1]; [1, 2, 3, 6], [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1]; ... For n = 6 the 6th row of A336811 is [6, 4, 3, 2, 2, 1, 1] so replacing every term with its divisors we have {[1, 2, 3, 6], [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1]} the same as the 6th row of this triangle. Also, if the sequence is written as an irregular tetrahedron so the first six slices are: ------------- [1], ------------- [1, 2]; ------------- [1, 3], [1]; ------------- [1, 2, 4], [1, 2], [1]; ------------- [1, 5], [1, 3], [1, 2], [1], [1]; ------------- [1, 2, 3, 6], [1, 2, 4], [1, 3], [1, 2], [1, 2], [1], [1]; ------------- The above slices appear in the lower zone of the following table which shows the correspondence between the mentioned divisors and the parts of the last section of the set of partitions of the positive integers. The table is infinite. It is formed by three zones as follows: The upper zone shows the last section of the set of partitions of every positive integer. The lower zone shows the same numbers but arranged as divisors in accordance with the slices of the tetrahedron mentioned above. Finally the middle zone shows the connection between the upper zone and the lower zone. For every positive integer the numbers in the upper zone are the same numbers as in the lower zone. |---|---------|-----|-------|---------|-----------|-------------|---------------| | n | | 1 | 2 | 3 | 4 | 5 | 6 | |---|---------|-----|-------|---------|-----------|-------------|---------------| | | | | | | | | 6 | | P | | | | | | | 3 3 | | A | | | | | | | 4 2 | | R | | | | | | | 2 2 2 | | T | | | | | | 5 | 1 | | I | | | | | | 3 2 | 1 | | T | | | | | 4 | 1 | 1 | | I | | | | | 2 2 | 1 | 1 | | O | | | | 3 | 1 | 1 | 1 | | N | | | 2 | 1 | 1 | 1 | 1 | | S | | 1 | 1 | 1 | 1 | 1 | 1 | |---|---------|-----|-------|---------|-----------|-------------|---------------| . |---|---------|-----|-------|---------|-----------|-------------|---------------| | | A207031 | 1 | 2 1 | 3 1 1 | 6 3 1 1 | 8 3 2 1 1 | 15 8 4 2 1 1 | | L | | | | |/| | |/|/| | |/|/|/| | |/|/|/|/| | |/|/|/|/|/| | | I | A182703 | 1 | 1 1 | 2 0 1 | 3 2 0 1 | 5 1 1 0 1 | 7 4 2 1 0 1 | | N | | * | * * | * * * | * * * * | * * * * * | * * * * * * | | K | A002260 | 1 | 1 2 | 1 2 3 | 1 2 3 4 | 1 2 3 4 5 | 1 2 3 4 5 6 | | | | = | = = | = = = | = = = = | = = = = = | = = = = = = | | | A207383 | 1 | 1 2 | 2 0 3 | 3 4 0 4 | 5 2 3 0 5 | 7 8 6 4 0 6 | |---|---------|-----|-------|---------|-----------|-------------|---------------| . |---|---------|-----|-------|---------|-----------|-------------|---------------| | | A027750 | 1 | 1 2 | 1 3 | 1 2 4 | 1 5 | 1 2 3 6 | | D |---------|-----|-------|---------|-----------|-------------|---------------| | I | A027750 | | | 1 | 1 2 | 1 3 | 1 2 4 | | V |---------|-----|-------|---------|-----------|-------------|---------------| | I | A027750 | | | | 1 | 1 2 | 1 3 | | S |---------|-----|-------|---------|-----------|-------------|---------------| | O | A027750 | | | | | 1 | 1 2 | | R | A027750 | | | | | 1 | 1 2 | | S |---------|-----|-------|---------|-----------|-------------|---------------| | | A027750 | | | | | | 1 | | | A027750 | | | | | | 1 | |---|---------|-----|-------|---------|-----------|-------------|---------------| . Note that every row in the lower zone lists A027750. The "section" is the simpler substructure of the set of partitions of n that has this property in the three zones. Also the lower zone for every positive integer can be constructued using the first n terms of A002865. For example: for n = 6 we consider the first 6 terms of A002865 (that is [1, 0, 1, 1, 2, 2] and then the 6th slice is formed by a block with the divisors of 6, no block with the divisors of 5, one block with the divisors of 4, one block with the divisors of 3, two block with the divisors of 2 and two blocks with the divisors of 1. Note that the lower zone is also in accordance with the tower (a polycube) described in A221529 in which its terraces are the symmetric representation of sigma starting from the top (cf. A237593) and the heights of the mentioned terraces are the partition numbers A000041 starting from the base. The tower has the same volume (also the same number of cubes) equal to A066186(n) as a prism of partitions of size 1*n*A000041(n). The above table shows the growth step by step of both the prism of partitions and its associated tower since the number of parts in the last section of the set of partitions of n is equal to A138137(n) equaling the number of divisors in the n-th slice of the lower table and equalimg the same the number of terms in the n-th row of triangle. Also the sum of all parts in the last section of the set of partitions of n is equal to A138879(n) equaling the sum of all divisors in the n-th slice of the lower table and equaling the sum of the n-th row of triangle. MATHEMATICA A336812[row_]:=Flatten[Table[ConstantArray[Divisors[row-m], PartitionsP[m]-PartitionsP[m-1]], {m, 0, row-1}]]; Array[A336812, 10] (* Generates 10 rows *) (* Paolo Xausa, Feb 16 2023 *) CROSSREFS Companion and subsequence of A338156. Row lengths give A138137. Row sums give A138879. Cf. A000041, A000070, A002260, A002865, A006128, A024916, A027750, A066186, A066633, A127093, A135010, A138121, A138785, A176206, A181187, A182703, A187219, A207031, A207038, A207383, A221529, A221530, A221531, A237593, A245095, A221649, A221650, A302246, A302247, A336811, A337209, A339106, A339258, A339278, A339304, A340035, A340061, A350357. Sequence in context: A122580 A265332 A107041 * A281426 A070099 A126760 Adjacent sequences: A336809 A336810 A336811 * A336813 A336814 A336815 KEYWORD nonn,look,tabf AUTHOR Omar E. Pol, Nov 20 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 28 23:19 EDT 2023. Contains 361596 sequences. (Running on oeis4.)