login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277075 Numbers n for which A276711(n) = 1 0
2, 4, 5, 8, 9, 10, 16, 22, 24, 25, 26, 36, 58, 64, 76, 82, 85, 120, 170, 196, 202, 214, 324, 328, 370, 412, 505, 562, 676, 706, 730, 799, 841, 1024, 1204, 1243, 1549, 1681, 1849, 2146, 2986, 10404, 46656, 52900, 112896, 122500 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Is the sequence finite?

a(47) > 10^7 if it exists.

LINKS

Table of n, a(n) for n=1..46.

EXAMPLE

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.

MAPLE

N:= 10^6: # to get all terms <= N

Primes:= select(isprime, [2, seq(i, i=3..N, 2)]):

Pows:= {0, 1, seq(seq(b^k, k=2..floor(log[b](N))), b=2..floor(sqrt(N)))}:

G:= expand(add(x^p, p=Primes)*add(x^r, r=Pows)):

B:= [seq(coeff(G, x, i), i=1..N)]:

select(t -> B[t]=1, [$1..N]);

CROSSREFS

Cf. A276711.

Sequence in context: A010443 A035269 A267703 * A038558 A286031 A027883

Adjacent sequences:  A277072 A277073 A277074 * A277076 A277077 A277078

KEYWORD

nonn,more

AUTHOR

Robert Israel, Sep 27 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 03:59 EST 2021. Contains 349530 sequences. (Running on oeis4.)