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”).

A375391
a(n) is the greatest odd number k such that n^2 + j is a semiprime for all odd numbers j from 1 to k.
1
-1, -1, 1, -1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, -1, -1, -1, 1, -1, -1, 1, -1, -1, 1, -1, -1, 1, 1, 1, -1, -1, -1, 3, 1, -1, -1, -1, 1, -1, -1, 1, -1, 9, 1, 3, -1, 3, 1, 1, 1, 1, -1, -1, -1, -1, -1, 1, 1, 3, 1, 1, -1, 1, 1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, 1, -1, 3, 1, 3, -1, -1, -1, -1
OFFSET
1,34
COMMENTS
a(n) = -1 if n^2 + 1 is not a semiprime.
a(n) <= 1 if n is odd, since n^2 + 3 is divisible by 4.
a(n) <= 15 since one of n^2 + 1, n^2 + 3, ..., n^2 + 17 is divisible by 9.
First occurrences of values: a(3) = 1, a(34) = 3, a(152) = 5, a(102) = 7, a(44) = 9, a(824264) = 11, a(21394) = 13, a(121364) = 15.
LINKS
EXAMPLE
a(44) = 9 since 44^2 + 1 = 1937 = 13 * 149, 44^2 + 3 = 1939 = 7 * 277, 44^2 + 5 = 1941 = 3 * 647, 44^2 + 7 = 1943 = 29 * 67 and 44^2 + 9 = 1945 = 5 * 389 are all semiprimes but 44^2 + 11 = 1947 = 3 * 11 * 59 is not a semiprime.
MAPLE
f:= proc(n) local i;
for i from 1 by 2 while numtheory:-bigomega(n^2+i) = 2 do od:
i-2
end proc:
map(f, [$1..100]);
CROSSREFS
KEYWORD
sign
AUTHOR
Robert Israel, Aug 15 2024
STATUS
approved