Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135418
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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 nth powers. +0
3
657, 57, 1, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

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.

Adjacent sequences: A135415 A135416 A135417 this_sequence A135419 A135420 A135421

Sequence in context: A065759 A088894 A015277 this_sequence A034818 A068260 A023294

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Dec 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 09:27 EDT 2009. Contains 160562 sequences.


AT&T Labs Research