|
|
A217376
|
|
Numbers n such that n, 2n-1 and 2n+1 all are prime or a prime power.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Since one of n, 2n-1, 2n+1 is divisible by 3 and thus is a power of 3, every term has one of the forms: 3^k, (3^k-1)/2, or (3^k+1)/2. - Max Alekseyev, Nov 10 2019
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Range[200], Length[FactorInteger[#]]==Length[FactorInteger[2#-1]] == Length[FactorInteger[2#+1]]==1&] (* Harvey P. Dale, Oct 12 2012 *)
|
|
PROG
|
(PARI) for(n=1, 9e9, omega(n)==1 & omega(2*n-1)==1 & omega(2*n+1)==1 & print1(n", ")) \\ - M. F. Hasler, Oct 01 2012
(Magma) [k:k in [2..1000]| forall{s:s in [k, 2*k-1, 2*k+1]| #PrimeDivisors(s) eq 1}]; // Marius A. Burtea, Nov 13 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|