|
Search: id:A145192
|
|
|
| A145192 |
|
Integers n for which Omega(6n-1)>2 and Omega(6n+1)>2 |
|
+0
1
|
|
| 141, 421, 479, 596, 629, 746, 801, 804, 904, 966, 981, 1016, 1042, 1051, 1119, 1121, 1142, 1146, 1154, 1261, 1289, 1296, 1324, 1329, 1384, 1399, 1406, 1454, 1471, 1493, 1499, 1560, 1576, 1597, 1637, 1646
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
(6*141)-1 = 845, which has >2 prime factors (counted with multiplicity), namely 5,13 and 13. (6*141)+1 = 847, which has >2 prime factors (counted with multiplicity), namely 7,11 and 11. So 141 is in the sequence.
|
|
MATHEMATICA
|
For[x = 6, x < 10001, x += 6, If[PrimeQ[x - 1] == True, y = "P", S = 0; F = FactorInteger[x - 1]; For[k = 1, k < Length[F] + 1, k++, S += F[[k]][[2]]]; If[S == 2, y = "A", y = "N"]]; If[PrimeQ[x + 1] == True, z = "P", S = 0; F = FactorInteger[x + 1]; For[k = 1, k < Length[F] + 1, k++, S += F[[k]][[2]]]; If[S == 2, z = "A", z = "N"]]; If[y == "N" && z == "N", Print[x/6]]]
|
|
CROSSREFS
|
Cf. A001222.
Sequence in context: A045936 A031892 A063373 this_sequence A068046 A005849 A066623
Adjacent sequences: A145189 A145190 A145191 this_sequence A145193 A145194 A145195
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Arran Fernandez (arran(AT)borve.org), Oct 03 2008
|
|
|
Search completed in 0.002 seconds
|
