cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A339351 Irregular triangle read by rows in which row n lists the compositions (ordered partitions) of n into distinct parts in lexicographic order.

Original entry on oeis.org

1, 2, 1, 2, 2, 1, 3, 1, 3, 3, 1, 4, 1, 4, 2, 3, 3, 2, 4, 1, 5, 1, 2, 3, 1, 3, 2, 1, 5, 2, 1, 3, 2, 3, 1, 2, 4, 3, 1, 2, 3, 2, 1, 4, 2, 5, 1, 6, 1, 2, 4, 1, 4, 2, 1, 6, 2, 1, 4, 2, 4, 1, 2, 5, 3, 4, 4, 1, 2, 4, 2, 1, 4, 3, 5, 2, 6, 1, 7, 1, 2, 5, 1, 3, 4, 1, 4, 3, 1, 5, 2, 1, 7, 2, 1, 5, 2, 5, 1, 2, 6, 3, 1, 4, 3, 4, 1, 3, 5, 4, 1, 3, 4, 3, 1, 5, 1, 2, 5, 2, 1, 5, 3, 6, 2, 7, 1, 8
Offset: 1

Views

Author

Ilya Gutkovskiy, Dec 01 2020

Keywords

Examples

			Triangle begins:
[1],
[2],
[1, 2], [2, 1], [3],
[1, 3], [3, 1], [4],
[1, 4], [2, 3], [3, 2], [4, 1], [5],
...
		

Crossrefs

Cf. A026793, A066099, A097910 (row lengths), A118457, A228369, A246688, A304797 (row sums), A339178.

Programs

  • Mathematica
    Table[Sort[Join @@ Permutations /@ Select[IntegerPartitions[n], UnsameQ @@ # &], OrderedQ[PadRight[{#1, #2}]] &], {n, 8}] // Flatten