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.

A211028 A list of ordered partitions of the positive integers.

Original entry on oeis.org

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

Views

Author

Omar E. Pol, Oct 30 2012

Keywords

Comments

We start with 1. Then for each positive integer j the sequence lists the partitions of j that do not contain 1 as a part, in lexicographical order. Then the sequence lists the partitions of j-1 together with one part of size 1 as the last part of that partition. Then the partitions of j-2 together with two parts of size 1, and so on.

Examples

			Written as an irregular triangle, in which row n lists the partitions of n, the sequence begins:
  {1};
  {2},{1,1};
  {3},{2,1},{1,1,1};
  {2,2},{4},{3,1},{2,1,1},{1,1,1,1};
  {3,2},{5},{2,2,1},{4,1},{3,1,1},{2,1,1,1},{1,1,1,1,1};
  {2,2,2},{4,2},{3,3},{6},{3,2,1},{5,1},{2,2,1,1},{4,1,1},{3,1,1,1},{2,1,1,1,1},{1,1,1,1,1,1};
  ...
		

Crossrefs