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.

A053343 Semiprimes of the form pq where p < q and p + q - 1 is prime.

Original entry on oeis.org

15, 33, 35, 51, 65, 77, 87, 91, 95, 119, 123, 143, 161, 177, 185, 209, 213, 215, 217, 221, 247, 259, 287, 303, 321, 329, 335, 341, 371, 377, 395, 403, 407, 411, 427, 437, 447, 469, 473, 485, 511, 515, 527, 533, 537, 545, 551, 573, 581, 591, 611, 629, 635
Offset: 1

Views

Author

Labos Elemer, Jan 05 2000

Keywords

Comments

Squarefree terms of A050530 with 2 prime divisors.
All terms are odd. - Muniru A Asiru, Aug 29 2017

Crossrefs

Subsequence of A291318.

Programs

  • GAP
    A053343:=List(Filtered(Filtered(List(Filtered(List([1..10^5],Factors),i->Length(i)=2),Set),j->Length(j)=2),i->IsPrime(Sum(i)-1)),Product); # Muniru A Asiru, Aug 29 2017
  • Mathematica
    With[{nn=70}, Take[Times@@@Select[Subsets[Prime[Range[nn]], {2}], PrimeQ[Total[#] - 1] &]//Union, nn]] (* Vincenzo Librandi, Aug 23 2017 *)
  • PARI
    list(lim)=my(v=List()); forprime(p=5,lim\3, forprime(q=3,min(lim\p,p-2), if(isprime(p+q-1), listput(v,p*q)))); Set(v) \\ Charles R Greathouse IV, Aug 23 2017
    

Formula

n=pq such that n-phi(n) = pq-(p-1)(q-1) = p+q-1 is prime.

Extensions

New name from Vincenzo Librandi Aug 23 2017