The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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. LINKS CROSSREFS Cf. A133483, A133484, A135419. Sequence in context: A233898 A088894 A015277 * A309963 A289290 A034818 Adjacent sequences:  A135415 A135416 A135417 * A135419 A135420 A135421 KEYWORD nonn AUTHOR Zak Seidov, Dec 01 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 21:07 EST 2021. Contains 349344 sequences. (Running on oeis4.)