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 A069233 #26 Jan 30 2025 05:09:36 %S A069233 3,5,11,17,29,41,49,59,71,101,107,111,115,121,137,149,169,179,191,197, %T A069233 201,202,203,205,206,227,239,269,281,287,289,291,295,311,314,319,321, %U A069233 347,361,403,419,431,461,469,471,505,521,526,527,569,599,617,622,623 %N A069233 Numbers k such that there is exactly 1 prime p satisfying the inequality k < p < k + tau(k)^2 where tau(k) = A000005(k). %C A069233 Numbers k such that A069230(k) = 1. - _Amiram Eldar_, Jan 29 2025 %H A069233 Amiram Eldar, <a href="/A069233/b069233.txt">Table of n, a(n) for n = 1..10000</a> %t A069233 q[k_] := Count[k + Range[1, DivisorSigma[0, k]^2 - 1], _?PrimeQ] == 1; Select[Range[640], q] (* _Amiram Eldar_, Jan 29 2025 *) %o A069233 (PARI) isok(n) = #select(x->isprime(x), vector(numdiv(n)^2-1, k, k+n)) == 1; \\ _Michel Marcus_, Jun 18 2017 %Y A069233 Cf. A000005, A049591, A069230, A069231, A069232. %K A069233 easy,nonn %O A069233 1,1 %A A069233 _Benoit Cloitre_, Apr 13 2002