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.

Showing 1-1 of 1 results.

A281575 Numbers k such that (d^2 + (k/d)^2)/2 is prime for all divisors d of k.

Original entry on oeis.org

3, 5, 11, 15, 19, 29, 35, 39, 51, 59, 61, 65, 69, 71, 79, 85, 95, 101, 131, 139, 141, 145, 159, 181, 199, 205, 209, 221, 231, 271, 299, 309, 329, 349, 371, 379, 391, 409, 415, 449, 461, 471, 519, 521, 535, 545, 559, 569, 571, 581, 631, 641, 649, 661, 685, 689, 739, 745, 751, 779, 799, 815, 821, 861
Offset: 1

Views

Author

Robert Israel and Thomas Ordowski, Jan 24 2017

Keywords

Comments

All terms are odd and squarefree.
Generalized Bunyakovsky conjecture implies for any odd prime p there are infinitely many terms of the form p*q where q is prime.

Examples

			15 is a member because (1^2 + 15^2)/2 = 113 and (3^2 + 5^2)/2 = 17 are prime.
		

Crossrefs

Contains A048161. Contained in A281505.

Programs

  • Maple
    filter:= n -> andmap(d -> isprime((d^2 + (n/d)^2)/2), numtheory:-divisors(n)):
    select(filter, [seq(i,i=1..3000, 2)]);
  • Mathematica
    pdnQ[n_]:=Module[{divs=Divisors[n]},AllTrue[(#^2+(n/#)^2)/2&/@ divs, PrimeQ]]; Select[Range[1000],pdnQ] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Feb 12 2017 *)
  • PARI
    isp(q) = (denominator(q)==1) && isprime(q);
    isok(n) = {fordiv(n, d, if (!isp((d^2 + (n/d)^2)/2), return(0));); return (1);} \\ Michel Marcus, Dec 11 2017
Showing 1-1 of 1 results.