Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Feb 01 2021 18:18:52
%S 6,11,18,20,27,30,37,38,51,66,67,70,83,85,102,123,128,135,146,171,198,
%T 219,227,248,258,260,264,291,326,346,363,402,443,486,515,521,531,578,
%U 627,629,678,731,732,735,786,843,902,963,1003,1026,1029,1034,1091,1158
%N Numbers of the form m^k+k, with m and k > 1.
%C For n=11, there are two representations: 2^3+3 and 3^2+2. All other numbers < 10^16 of this form have a unique representation. The uniqueness question leads to a Pillai-like exponential Diophantine equation a^x-b^y = y-x for y > x > 1 and b > a > 1, which appears to have only one solution.
%H Robert Israel, <a href="/A099225/b099225.txt">Table of n, a(n) for n = 1..10000</a>
%p N:= 2000: # for terms <= N
%p S:= {}:
%p for k from 2 to floor(log[2](N)) do
%p S:= S union {seq(m^k+k, m=2..floor((N-k)^(1/k)))}
%p od:
%p sort(convert(S,list)); # _Robert Israel_, Apr 28 2019
%t nLim=2000; lst={}; Do[k=2; While[n=m^k+k; n<=nLim, AppendTo[lst, n]; k++ ], {m, 2, Sqrt[nLim]}]; Union[lst]
%Y Cf. A057897 (numbers of the form m^k-k, with m and k > 1), A074981 (n such that there is no solution to Pillai's equation), A099226 (numbers that can be represented as both a^x+x and b^y-y, for some a, b, x, y > 1).
%K nonn
%O 1,1
%A _T. D. Noe_, Oct 06 2004