A175025 - OEIS

%I #9 Dec 13 2015 01:05:22

%S 1,1,1,2,2,1,1,1,1,3,3,1,2,1,1,1,1,1,1,2,2,4,4,1,3,1,1,2,1,1,1,2,2,1,

%T 1,1,1,1,1,3,2,5,5,1,4,1,1,3,1,1,1,3,2,1,2,2,1,1,2,1,1,1,1,1,1,1,1,1,

%U 1,4,2,2,2,2,3,3,6,6,1,5,1,1,4,1,1,1,4,2,1,3,2,1,1,3,1,1,1,1,3,3,1,2,2,1,1

%N 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 nonincreasing order.

%C 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 Table to start:

%e 1

%e 1,1

%e 2

%e 2,1

%e 1,1,1

%e 3

%e 3,1

%e 2,1,1

%e 1,1,1,1

%e 2,2

%e 4

%e 4,1

%e 3,1,1

%e 2,1,1,1

%e 2,2,1

%e 1,1,1,1,1

%e 3,2

%e 5

%e 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 Cf. A175020, A175022, A175023, A175024.

%K base,nonn,tabf

%O 1,4

%A _Leroy Quet_, Nov 03 2009

%E Extended by _Ray Chandler_, Mar 11 2010