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.

A175024 Irregular table read by rows: Row n (of A175022(n) terms) contains the terms of row n of table A175023 with these terms arranged in nondecreasing order.

Original entry on oeis.org

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

Views

Author

Leroy Quet, Nov 03 2009

Keywords

Comments

This table lists the parts of the partitions of the positive integers. Each partition is represented exactly once in this table. If n is such that 2^(m-1) <= A175020(n) <= 2^m -1, then row n of this table gives one partition of m.

Examples

			Table to start:
1
1,1
2
1,2
1,1,1
3
1,3
1,1,2
1,1,1,1
2,2
4
1,4
1,1,3
1,1,1,2
1,2,2
1,1,1,1,1
2,3
5
Note there are: 1 row that sums to 1, two rows that sum to 2, three rows that sum to 3, five rows that sum to 4, seven rows that sum to 5, etc, where 1,2,3,5,7,... are the number of unrestricted partitions of 1,2,3,4,5,...
		

Crossrefs

Extensions

Extended by Ray Chandler, Mar 11 2010