login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088906 Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j. 1
1, 2, 4, 6, 10, 72, 4097, 8192, 16777217, 33554432, 137438953472, 562949953421312, 1152921504606846977, 2305843009213693952, 1329227995784915874056728564887191552, 22300745198530623141535718272648361505980417 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
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, Sep 09 2005
LINKS
CROSSREFS
Sequence in context: A058960 A036053 A237816 * A303752 A304532 A345091
KEYWORD
nonn
AUTHOR
Entry completely revised by Hugo Pfoertner and Reinhard Zumkeller, Oct 20 2004
EXTENSIONS
Two more terms from Hugo Pfoertner, Oct 12 2004
a(9) - a(15) from David Wasserman, Sep 09 2005
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)