|
Search: id:A059519
|
|
|
| A059519 |
|
Number of partitions of n all of whose subpartitions sum to distinct values. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ... |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 16, 17, 18, 19, 20, 21, 24, 26, 28, 32, 33, 34, 35, 36, 37, 38, 40, 41, 44, 48, 50, 52, 56, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 80, 81, 84, 88, 96, 98, 100, 104, 112, 116, 128, 129, 130, 131, 132, 133, 134, 136, 137, 138, 139, 140
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Partition encoding as in A029931. Complement of A059520.
|
|
EXAMPLE
|
14=2+4+8 so Partition(14) = [2,3,4], whose sub-sums are 0,2,3,4,5,6,7 and 14.
|
|
CROSSREFS
|
A029931, A059520.
Sequence in context: A048265 A002180 A102799 this_sequence A163101 A157465 A067942
Adjacent sequences: A059516 A059517 A059518 this_sequence A059520 A059521 A059522
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Jan 19 2001
|
|
|
Search completed in 0.002 seconds
|
