This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A277075 #13 Jun 02 2025 12:19:39
%S A277075 2,4,5,8,9,10,16,22,24,25,26,36,58,64,76,82,85,120,170,196,202,214,
%T A277075 324,328,370,412,505,562,676,706,730,799,841,1024,1204,1243,1549,1681,
%U A277075 1849,2146,2986,10404,46656,52900,112896,122500
%N A277075 Numbers n for which A276711(n) = 1.
%C A277075 Is the sequence finite?
%C A277075 a(47) > 10^7 if it exists.
%e A277075 122500 is in the sequence because 122500 = 121169 + 11^3 is the only way to write 122500 as the sum of a prime and a nonnegative perfect power.
%p A277075 N:= 10^6: # to get all terms <= N
%p A277075 Primes:= select(isprime, [2,seq(i,i=3..N,2)]):
%p A277075 Pows:= {0,1,seq(seq(b^k,k=2..floor(log[b](N))),b=2..floor(sqrt(N)))}:
%p A277075 G:= expand(add(x^p,p=Primes)*add(x^r,r=Pows)):
%p A277075 B:= [seq(coeff(G,x,i),i=1..N)]:
%p A277075 select(t -> B[t]=1, [$1..N]);
%Y A277075 Cf. A276711.
%K A277075 nonn,more
%O A277075 1,1
%A A277075 _Robert Israel_, Sep 27 2016