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.

A138136 Triangle read by rows: row n lists the parts > 1 of the last section of the set of partitions of n.

Original entry on oeis.org

0, 2, 3, 4, 2, 2, 5, 3, 2, 6, 4, 2, 3, 3, 2, 2, 2, 7, 5, 2, 4, 3, 3, 2, 2, 8, 6, 2, 5, 3, 4, 4, 4, 2, 2, 3, 3, 2, 2, 2, 2, 2, 9, 7, 2, 6, 3, 5, 4, 5, 2, 2, 4, 3, 2, 3, 3, 3, 3, 2, 2, 2, 10, 8, 2, 7, 3, 6, 4, 6, 2, 2, 5, 5, 5, 3, 2, 4, 4, 2, 4, 3, 3, 4, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2
Offset: 1

Views

Author

Omar E. Pol, Mar 23 2008

Keywords

Comments

See A138138 and A138151 for more information.

Examples

			Triangle begins:
0;
2;
3;
4,2,2;
5,3,2;
6,4,2,3,3,2,2,2;
7,5,2,4,3,3,2,2;
8,6,2,5,3,4,4,4,2,2,3,3,2,2,2,2,2;
9,7,2,6,3,5,4,5,2,2,4,3,2,3,3,3,3,2,2,2;
10,8,2,7,3,6,4,6,2,2,5,5,5,3,2,4,4,2,4,3,3,4,2,2,2,3,3,2,2,2,2,2,2,2;
...
		

Crossrefs

Programs

  • Mathematica
    Join[{0}, Table[Cases[IntegerPartitions[n], x_ /; Last[x] != 1], {n, 10}]] // Flatten (* Robert Price, May 22 2020 *)