|
|
A117118
|
|
Number of partitions of n into consecutive parts containing no binary powers.
|
|
0
|
|
|
0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 2, 1, 1, 0, 1, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 0, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 3, 3, 1, 3, 1, 2, 3, 2, 1, 2, 0, 2, 2, 2, 1, 4, 1, 2, 2, 2, 2, 4, 1, 2, 3, 2, 1, 3, 2, 2, 3, 2, 2, 3, 1, 2, 3, 2, 1, 2, 2, 3, 1, 2, 2, 2, 2, 2, 3, 2, 1, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,11
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(60) = #{10+11+12+13+14, 19+20+21, 60} = 3, 4+5+6+7+8+9+10+11=60 doesn't count because 4=2^2 or 8=2^3.
|
|
MATHEMATICA
|
a[n_] := a[n] = Count[IntegerPartitions[n, All, Cases[Range[3, n], k_Integer /; Total[IntegerDigits[k, 2]] > 1]], q_List /; Length[q] == Length[Union[q]] && Length[q] == First[q] - Last[q] + 1];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|