|
|
A115103
|
|
Primes p such that p-1 and p+1 have the same number of prime factors with multiplicity.
|
|
6
|
|
|
5, 19, 29, 43, 67, 89, 151, 173, 197, 233, 271, 283, 307, 317, 349, 461, 491, 569, 571, 593, 653, 701, 739, 751, 787, 857, 859, 907, 919, 1013, 1061, 1097, 1277, 1291, 1303, 1483, 1667, 1747, 1831, 1867, 1889, 1913, 1973, 2003, 2083, 2131, 2311, 2357, 2393
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
19-1 = 2*3*3 has 3 factors. 19+1 = 2*2*5 has 3 factors. So 19 is in the table.
|
|
MAPLE
|
isA115103 := proc(n)
if not type(n, prime) then
return false;
end if;
if numtheory[bigomega](n-1) <> numtheory[bigomega](n+1) then
false;
else
true ;
end if ;
end proc:
for n from 2 to 3000 do
if isA115103(n) then
printf("%d, ", n) ;
end if;
# second Maple program:
q:= p-> isprime(p) and (f-> f(p+1)=f(p-1))(numtheory[bigomega]):
|
|
MATHEMATICA
|
Select[Prime[Range[400]], PrimeOmega[#-1]==PrimeOmega[#+1]&] (* Harvey P. Dale, Apr 26 2014 *)
|
|
PROG
|
(PARI) g(n) = forprime(x=1, n, p1=bigomega(x-1); p2=bigomega(x+1); if(p1==p2, print1(x", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|