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 + ...

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

Offset

1,1

Comments

Partition encoding as in A029931. Complement of A059519.

Links

Table of n, a(n) for n=1..64.

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: A257521 A053696 A090503 * A371784 A293576 A233301

Adjacent sequences: A059517 A059518 A059519 * A059521 A059522 A059523

Keyword

easy,nonn

Author

Marc LeBrun, Jan 19 2001

Status

approved