login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A360994
Numbers k such that (2^k + 1)^3 - 2 is a semiprime.
3
0, 1, 2, 4, 5, 6, 13, 14, 18, 27, 43, 45, 63, 76, 85, 108, 115, 119, 123, 187, 211, 215, 283, 312
OFFSET
1,3
COMMENTS
a(25) >= 355.
623, 674, 711, 766, 767 are also in this sequence, but their position cannot be established before finding any factor for the values corresponding to the following "blockers": 355, 511, 587, 707, 731.
1424, 1470, 1580, 1946, 2117, 2693, 3000, 3540, 4164, 7043, 9475, 10632, 15018, 19064, 27130, 28266, 28532, 46434, 58768, 103536 are some larger members of this sequence, but their position cannot be established. These produce "trivial" semiprimes where one prime is small (e.g., 3 or 5).
FORMULA
{ k >= 0 : A099359(k) in { A001358 } }.
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 [1..70]| IsSemiprime(s) where s is (2^n+1)^3-2];
(PARI) isok(n) = bigomega((2^n+1)^3-2) == 2;
KEYWORD
nonn,more,hard
AUTHOR
Serge Batalov, Feb 27 2023
STATUS
approved