A135418 - OEIS

This site is supported by donations to The OEIS Foundation.

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.

657, 57, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`For n=1,2 the 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	`Cf. A133483, A133484, A135419.` `Sequence in context: A194653 A088894 A015277 * A034818 A068260 A198207` `Adjacent sequences: A135415 A135416 A135417 * A135419 A135420 A135421`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Dec 01 2007`

Content is available under The OEIS End-User License Agreement .

Last modified February 12 18:43 EST 2012. Contains 205432 sequences.