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.

A329857 Positive integers which can be represented as p*q - p - q where p and q are distinct odd primes.

This page as a plain text file.
%I A329857 #24 Jan 16 2020 05:31:36
%S A329857 7,11,19,23,31,35,39,43,47,55,59,63,71,79,83,87,91,95,103,107,111,115,
%T A329857 119,131,139,143,155,159,163,167,175,179,183,191,199,203,207,211,215,
%U A329857 219,223,231,239,251,259,263,271,275,279,287,295,299,311,323,327,331,335,343,347,351,355,359
%N A329857 Positive integers which can be represented as p*q - p - q where p and q are distinct odd primes.
%t A329857 Select[Range[360], {} != Solve[p*q-p-q  == # && p >q> 2, {p,q}, Primes] &] (* _Giovanni Resta_, Jan 16 2020 *)
%o A329857 (PARI) lim=1000; x=[]; forprime(p=3, lim/3, forprime(q=p+2, lim/3, if(setsearch(x,p*q-q-p),, x=setunion(x,[p*q-q-p])))); for(i=1, length(x), if(x[i]<(lim), print1(x[i], ", ")))
%Y A329857 Cf. A037165 (a subsequence), A046388, A091305, A096345, A137367 (subsequence with twin primes), A218862.
%K A329857 nonn,easy
%O A329857 1,1
%A A329857 _Craig J. Beisel_, Nov 22 2019