This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A366330 #21 Oct 14 2023 07:55:52 %S A366330 2,15,33,51,69,87,123,141,159,177,213,249,267,303,321,339,393,411,447, %T A366330 501,519,537,573,591,665,681,699,717,753,771,789,807,819,843,879,933, %U A366330 951,1015,1041,1059,1077,1149,1167,1203,1235,1257,1293,1329,1347,1383 %N A366330 Minimal numbers (with respect to division) with no coprime divisor shift. %C A366330 A number k has a coprime divisor shift s if GCD(d + s, n) = 1 for all divisors d of k. %C A366330 A number k has a coprime divisor shift iff it is not divisible by any number in the sequence. %C A366330 If k has no coprime divisor shift, then so is any multiple of k. %D A366330 a(1) = 2 for GCD(2 + 0, 2) > 1 and GCD(1 + 1, 2) > 1. %D A366330 a(2) = 15 for GCD(3 + 0, 15) > 1, GCD(5 + 1, 15) > 1, GCD(1 + 2, 15) > 1, and any odd number between 2 and 15 has a coprime divisor shift. %H A366330 M. Farrokhi D. G., <a href="/A366330/b366330.txt">Table of n, a(n) for n = 1..10000</a> %Y A366330 Cf. A044135, A044516, A366219, A366251. %K A366330 nonn %O A366330 1,1 %A A366330 _M. Farrokhi D. G._, Oct 07 2023