|
Search: id:A079149
|
|
|
| A079149 |
|
Primes p such that either p-1 or p+1 has at most 2 prime factors, counted with multiplicity; i.e. primes p such that either bigomega(p-1) <= 2 or bigomega(p+1) <= 2, where bigomega(n) = A001222(n). |
|
+0
5
|
|
| 2, 3, 5, 7, 11, 13, 23, 37, 47, 59, 61, 73, 83, 107, 157, 167, 179, 193, 227, 263, 277, 313, 347, 359, 383, 397, 421, 457, 467, 479, 503, 541, 563, 587, 613, 661, 673, 719, 733, 757, 839, 863, 877, 887, 983, 997, 1019, 1093, 1153, 1187, 1201, 1213, 1237
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There are only 2 primes such that both p-1 and p+1 have at most 2 prime factors - 3 and 5. Proof: If p>5 then whichever of p-1 and p+1 is divisible by 4 has at least 3 prime factors.
Primes which not are the sum of two consecutive composite numbers. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Nov 15 2009]
|
|
PROGRAM
|
(PARI) s(n) = {sr=0; ct=0; forprime(x=2, n, if(bigomega(x-1) < 3 || bigomega(x+1) < 3, print1(x" "); sr+=1.0/x; ct+=1; ); ); print(); print(ct" "sr); } \\ Lists primes p<=n such that p+-1 has at most 2 prime factors.
|
|
CROSSREFS
|
Union of A079147 and A079148. Cf. A079152.
Sequence in context: A095080 A087634 A038970 this_sequence A024694 A024320 A111252
Cf. A060254. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Nov 15 2009]
Adjacent sequences: A079146 A079147 A079148 this_sequence A079150 A079151 A079152
|
|
KEYWORD
|
easy,nonn,new
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Dec 27 2002
|
|
|
Search completed in 0.002 seconds
|
