cp's OEIS Frontend

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.

A064653 Integers not expressible as p + q*a^2, a>1 and p, q are primes.

This page as a plain text file.
%I A064653 #21 Jun 18 2019 03:30:40
%S A064653 1,2,3,4,5,6,7,8,9,12,16,18,24,26,28,36,42,60,72,84,90,96,108,240,300,
%T A064653 420,1050,1260
%N A064653 Integers not expressible as p + q*a^2, a>1 and p, q are primes.
%C A064653 _Dean Hickerson_ (Oct 12 2001) writes: I suspect that there are no more terms in the sequence. In fact, I'll make the stronger conjecture that for all n>1260, n can be written as p + q*a^2 where a is the smallest prime that does not divide n. For example, for n=10080, a=11 and we have the representation 10080 = 7297 + 23 * 11^2.
%C A064653 There are no other terms up to 10^7.
%C A064653 Hickerson's stronger conjecture holds for n <= 10^9. Therefore, there are no other terms up to 10^9. - _David A. Corneth_, Jun 17 2019
%e A064653 18 is in the sequence because p + 2*2^2 would imply that p is 10, or p + 2*3^2 would imply that p is 0, or p+ 3*2^2 would imply that p is 6, all of which are composite numbers.
%t A064653 Complement[Range[2000], Union@Flatten@Outer[Plus, Prime[Range[PrimePi[2000]]], Union@Flatten@Outer[Times, Prime[Range[PrimePi[2000]]], Table[a^2, {a, 2, 20}]]]] (* _Robert Price_, Jun 16 2019 *)
%Y A064653 A subsequence of A064915.
%K A064653 nonn,more
%O A064653 1,2
%A A064653 _Robert G. Wilson v_, Oct 07 2001
%E A064653 Two more terms from _Dean Hickerson_, Oct 12 2001