|
Search: id:A125106
|
|
|
| A125106 |
|
Enumeration of partitions by binary representation: each 1 is a part; the part size is 1 more than the number of zeros in the rest of the number. |
|
+0
9
|
|
| 1, 2, 1, 1, 3, 2, 1, 2, 2, 1, 1, 1, 4, 3, 1, 3, 2, 2, 1, 1, 3, 3, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 5, 4, 1, 4, 2, 3, 1, 1, 4, 3, 3, 2, 1, 3, 2, 2, 2, 1, 1, 1, 4, 4, 3, 3, 1, 3, 3, 2, 2, 2, 1, 1, 3, 3, 3, 2, 2, 2, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Another way to describe this: starting with the binary representation and a counter set at one, count the zeros from right to left. Write a term equal to the counter for each "1" encountered.
A101211 is a similar sequence with A005811 elements per row which maps natural numbers to compositions (ordered partitions).
There are two ways to consider this as a table: taking each partition as a row, or taking the partitions generated by 2^(n-1) through 2^n-1 as a row.
Taking the nth row as multiple partitions, it consists of those partitions with the first hook size (largest part plus number of parts minus 1) equal to n. The number of integers in this nth row is A001792(n-1), and the row sum is A049611.
Taking each partition as a separate row, the row lengths are A000120, and the row sums are A161511.
|
|
FORMULA
|
Partition 2n is partition n with every part size increased by 1; partition 2n+1 is partition n with an additional part of size 1.
|
|
EXAMPLE
|
Row 4:
1000 [4]
1001 [3,1]
1010 [3,2]
1011 [2,1,1]
1100 [3,3]
1101 [2,2,1]
1110 [2,2,2]
1111 [1,1,1,1]
|
|
CROSSREFS
|
Cf. A000041,A000120,A161511,A005811,A101211,A001792,A049611,A126411.
Sequence in context: A079216 A112380 A165162 this_sequence A152538 A141110 A025831
Adjacent sequences: A125103 A125104 A125105 this_sequence A125107 A125108 A125109
|
|
KEYWORD
|
tabf,nice,nonn
|
|
AUTHOR
|
Alford Arnold (Alford1940(AT)aol.com), Dec 10 2006
|
|
EXTENSIONS
|
Edited by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jun 11 2009
|
|
|
Search completed in 0.005 seconds
|
