Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146756
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146756 Smallest numbers expressible as the sum of n positive nth powers in exactly n distinct ways +0
3
1, 65, 5104, 300834, 9006349824 (list; graph; listen)
OFFSET

1,2

COMMENT

It is not known if any terms exist in this sequence beyond n=4.

Contribution from Donovan Johnson (donovan.johnson(AT)yahoo.com), Nov 08 2008: (Start)

a(5) = 9006349824 = 8^5 + 34^5 + 62^5 + 68^5 + 92^5 = 8^5 + 41^5 + 47^5 + 79^5 + 89^5 = 12^5 + 18^5 + 72^5 + 78^5 + 84^5 = 21^5 + 34^5 + 43^5 + 74^5 + 92^5 = 24^5 + 42^5 + 48^5 + 54^5 + 96^5.

Per email communication from Ian Rayson, the nth powers for each sum must be distinct. If duplicate nth powers were allowed, a(4) would be 236674 while the other terms would remain unchanged. (End)

EXAMPLE

for n=2, 65= 1^2 + 8^2 = 4^2 + 7^2

CROSSREFS

Sequence in context: A027535 A110900 A084272 this_sequence A115432 A116104 A116121

Adjacent sequences: A146753 A146754 A146755 this_sequence A146757 A146758 A146759

KEYWORD

hard,more,nonn

AUTHOR

Ian Rayson (Ian.Rayson(AT)studentmail.newcastle.edu.au), Nov 02 2008

EXTENSIONS

a(5) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Nov 08 2008

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 December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research