|
Search: id:A059520
|
|
|
| A059520 |
|
Number of partitions into distinct parts, with some sub-partitions having equal sums. Partition(n) = [a, b, c...] where 2n = 2^a + 2^b + 2^c + ... |
|
+0
2
|
|
| 7, 13, 15, 22, 23, 25, 27, 29, 30, 31, 39, 42, 43, 45, 46, 47, 49, 51, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 71, 75, 76, 77, 78, 79, 82, 83, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 97, 99, 101, 102, 103, 105, 106, 107, 108, 109, 110, 111, 113, 114, 115, 117, 118, 119
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Partition encoding as in A029931. Complement of A059519.
|
|
EXAMPLE
|
13=1+4+8 so Partition(13) = [1,3,4], whose sub-sums are 0,1,3,4,5,7 and 13, with 4 twice (once from 1+3 and once from 4 by itself).
|
|
CROSSREFS
|
A029931, A059519.
Sequence in context: A076196 A053696 A090503 this_sequence A102797 A072459 A118942
Adjacent sequences: A059517 A059518 A059519 this_sequence A059521 A059522 A059523
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Jan 19 2001
|
|
|
Search completed in 0.002 seconds
|
