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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A340031 Irregular triangle read by rows T(n,k) in which row n lists n blocks, where the m-th block consists of A000041(m-1) copies of the j-th row of triangle A127093, where j = n - m + 1 and 1 <= m <= n. 8
1, 1, 2, 1, 1, 0, 3, 1, 2, 1, 1, 1, 2, 0, 4, 1, 0, 3, 1, 2, 1, 2, 1, 1, 1, 1, 0, 0, 0, 5, 1, 2, 0, 4, 1, 0, 3, 1, 0, 3, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 0, 0, 6, 1, 0, 0, 0, 5, 1, 2, 0, 4, 1, 2, 0, 4, 1, 0, 3, 1, 0, 3, 1, 0, 3, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Another version of A338156 which is the main sequence with further information about the correspondence divisor/part.
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..11552 (rows 1..17 of the triangle, flattened)
EXAMPLE
Triangle begins:
[1];
[1,2], [1];
[1,0,3], [1,2], [1], [1];
[1,2,0,4], [1,0,3], [1,2], [1,2], [1], [1], [1];
[1,0,0,0,5],[1,2,0,4],[1,0,3],[1,0,3],[1,2],[1,2],[1,2],[1],[1],[1],[1],[1];
[...
Written as an irregular tetrahedron the first five slices are:
[1],
-------
[1, 2],
[1],
----------
[1, 0, 3],
[1, 2],
[1],
[1];
-------------
[1, 2, 0, 4],
[1, 0, 3],
[1, 2],
[1, 2],
[1],
[1],
[1];
----------------
[1, 0, 0, 0, 5],
[1, 2, 0, 4],
[1, 0, 3],
[1, 0, 3],
[1, 2],
[1, 2],
[1, 2],
[1],
[1],
[1],
[1],
[1];
.
The following table formed by three zones shows the correspondence between divisors and parts (n = 1..5):
.
|---|---------|-----|-------|---------|-----------|-------------|
| n | | 1 | 2 | 3 | 4 | 5 |
|---|---------|-----|-------|---------|-----------|-------------|
| P | | | | | | |
| A | | | | | | |
| R | | | | | | |
| T | | | | | | 5 |
| I | | | | | | 3 2 |
| T | | | | | 4 | 4 1 |
| I | | | | | 2 2 | 2 2 1 |
| O | | | | 3 | 3 1 | 3 1 1 |
| N | | | 2 | 2 1 | 2 1 1 | 2 1 1 1 |
| S | | 1 | 1 1 | 1 1 1 | 1 1 1 1 | 1 1 1 1 1 |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
| | A181187 | 1 | 3 1 | 6 2 1 | 12 5 2 1 | 20 8 4 2 1 |
| L | | | | |/| | |/|/| | |/|/|/| | |/|/|/|/| |
| I | A066633 | 1 | 2 1 | 4 1 1 | 7 3 1 1 | 12 4 2 1 1 |
| N | | * | * * | * * * | * * * * | * * * * * |
| K | A002260 | 1 | 1 2 | 1 2 3 | 1 2 3 4 | 1 2 3 4 5 |
| | | = | = = | = = = | = = = = | = = = = = |
| | A138785 | 1 | 2 2 | 4 2 3 | 7 6 3 4 | 12 8 6 4 5 |
|---|---------|-----|-------|---------|-----------|-------------|
.
|---|---------|-----|-------|---------|-----------|-------------|
| | A127093 | 1 | 1 2 | 1 0 3 | 1 2 0 4 | 1 0 0 0 5 |
| |---------|-----|-------|---------|-----------|-------------|
| | A127093 | | 1 | 1 2 | 1 0 3 | 1 2 0 4 |
| |---------|-----|-------|---------|-----------|-------------|
| D | A127093 | | | 1 | 1 2 | 1 0 3 |
| I | A127093 | | | 1 | 1 2 | 1 0 3 |
| V |---------|-----|-------|---------|-----------|-------------|
| I | A127093 | | | | 1 | 1 2 |
| S | A127093 | | | | 1 | 1 2 |
| O | A127093 | | | | 1 | 1 2 |
| R |---------|-----|-------|---------|-----------|-------------|
| S | A127093 | | | | | 1 |
| | A127093 | | | | | 1 |
| | A127093 | | | | | 1 |
| | A127093 | | | | | 1 |
| | A127093 | | | | | 1 |
|---|---------|-----|-------|---------|-----------|-------------|
.
The table is essentially the same table of A338156 but here, in the lower zone, every row is A127093 instead of A027750.
.
MATHEMATICA
A127093row[n_]:=Table[Boole[Divisible[n, k]]k, {k, n}];
A340031row[n_]:=Flatten[Table[ConstantArray[A127093row[n-m+1], PartitionsP[m-1]], {m, n}]];
Array[A340031row, 7] (* Paolo Xausa, Sep 28 2023 *)
CROSSREFS
Row sums give A066186.
Nonzero terms gives A338156.
Sequence in context: A116399 A116405 A281048 * A029352 A340011 A055168
KEYWORD
nonn,tabf
AUTHOR
Omar E. Pol, Dec 26 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 27 09:38 EDT 2024. Contains 372017 sequences. (Running on oeis4.)