|
Search: id:A088906
|
|
|
| A088906 |
|
Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j. |
|
+0
2
|
|
| 1, 2, 4, 6, 10, 72, 4097, 8192, 16777217, 33554432, 137438953472, 562949953421312, 1152921504606846977, 2305843009213693952, 1329227995784915874056728564887191552, 22300745198530623141535718272648361505980417
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A088904(a(n))=n and A088904(k)<n for 1<=k<a(n).
The values for a(14) and a(15) are not quite proved to be minimal. For 14 (resp. 15) I have checked all numbers that have at least one representation with j > 10 (resp. 12). Both of these values are greater than 2^120+1, which has 16 representations. - David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2005
|
|
CROSSREFS
|
Sequence in context: A073308 A058960 A036053 this_sequence A063183 A057661 A097954
Adjacent sequences: A088903 A088904 A088905 this_sequence A088907 A088908 A088909
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Entry completely revised by Hugo Pfoertner (hugo(AT)pfoertner.org) and Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 20 2004
|
|
EXTENSIONS
|
Two more terms from Hugo Pfoertner (hugo(AT)pfoertner.org), Oct 12 2004
a(9) - a(15) from David Wasserman (wasserma(AT)spawar.navy.mil), Sep 09 2005
|
|
|
Search completed in 0.002 seconds
|
