|
|
A306248
|
|
Smallest m for which 2n is not m-powerful (for the definition of k-powerful see A323395).
|
|
1
|
|
|
1, 2, 1, 3, 1, 3, 1, 4, 1, 3, 1, 4, 1, 3, 1, 5, 1, 3, 1, 5, 1, 3, 1, 6, 1, 3, 1, 5, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This function is known as m*(2n). For odd n all values of m*(n) are 0.
|
|
LINKS
|
|
|
EXAMPLE
|
The bipartition {1,4}, {2,3} of {1,2,3,4} has equal first power-sums. But there is no such bipartition with equal power-sums for exponents 0, 1, and 2. Therefore a(2) = 2.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|