|
|
A360993
|
|
Numbers k such that (2^k - 1)^3 + 2 is a semiprime.
|
|
3
|
|
|
4, 5, 8, 12, 13, 18, 20, 29, 38, 56, 60, 62, 76, 82, 101, 118, 202, 210, 230, 276, 328, 332, 336, 338, 368
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(26) >= 406.
438, 500, 526, 604, 648, 696 are also in this sequence, but their positions cannot be established before finding any factor for the values corresponding to the following "blockers": 406, 496, 528.
2382, 2733, 2910, 3368, 3508, 5338, 7705, 11185, 19905, 23814, 38545, 179294 are larger terms of this sequence, but their positions cannot be established. These produce "trivial" semiprimes where one prime is small (e.g., 3 or 11).
|
|
LINKS
|
|
|
EXAMPLE
|
a(1) = 4 because 15^3 + 2 = 3377 = 11 * 307, which is semiprime.
a(2) = 5 because 31^3 + 2 = 29793 = 3 * 9931, which is semiprime.
|
|
MATHEMATICA
|
Select[Range[70], PrimeOmega[(2^# - 1)^3 - 2] == 2 &]
|
|
PROG
|
(Magma) IsSemiprime:=func<i | &+[d[2]: d in Factorization(i)] eq 2>; [n: n in [2..70]| IsSemiprime(s) where s is (2^n-1)^3+2];
(PARI) isok(n) = bigomega((2^n-1)^3+2) == 2;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|