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.
%I A175024 #9 Dec 12 2015 17:55:01 %S A175024 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, %T A175024 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, %U A175024 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 %N 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. %C A175024 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. %e A175024 Table to start: %e A175024 1 %e A175024 1,1 %e A175024 2 %e A175024 1,2 %e A175024 1,1,1 %e A175024 3 %e A175024 1,3 %e A175024 1,1,2 %e A175024 1,1,1,1 %e A175024 2,2 %e A175024 4 %e A175024 1,4 %e A175024 1,1,3 %e A175024 1,1,1,2 %e A175024 1,2,2 %e A175024 1,1,1,1,1 %e A175024 2,3 %e A175024 5 %e A175024 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,... %Y A175024 Cf. A175020, A175022, A175023, A175025. %K A175024 base,nonn,tabf %O A175024 1,4 %A A175024 _Leroy Quet_, Nov 03 2009 %E A175024 Extended by _Ray Chandler_, Mar 11 2010