A088906 - OEIS

A088906

Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j.

%I #7 Mar 31 2012 13:20:51

%S 1,2,4,6,10,72,4097,8192,16777217,33554432,137438953472,

%T 562949953421312,1152921504606846977,2305843009213693952,

%U 1329227995784915874056728564887191552,22300745198530623141535718272648361505980417

%N Smallest number m>0 having n representations m = x^i + x^j with 1<x<=m and 0<=i<=j.

%C A088904(a(n))=n and A088904(k)<n for 1<=k<a(n).

%C 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

%K nonn

%O 0,2

%A Entry completely revised by _Hugo Pfoertner_ and _Reinhard Zumkeller_, Oct 20 2004

%E Two more terms from _Hugo Pfoertner_, Oct 12 2004

%E a(9) - a(15) from _David Wasserman_, Sep 09 2005