login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A135418
Number of ways of splitting the numbers from 1 to 16 into two groups so that the numbers in each group have the same sum of n-th powers.
2
657, 57, 1, 1
OFFSET
1,1
COMMENTS
For n=1,2 there are numerous ways, while for each of n=3 and n=4 there is only one way: n=3:{1,4,6,7,10,11,13,16},{2,3,5,8,9,12,14,15} (see A133483-A133484), n=4: {1,2,3,4,8,9,10,11,12,16},{5,6,7,13,14,15}.
Presumably for n >= 4 there are no solutions.
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Dec 01 2007
STATUS
approved