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 A109567 #6 Jun 03 2025 01:07:58
%S A109567 15683,28229,45893,48679,59281,60539,74959,86869,100853,106033,107509,
%T A109567 114493,117443,118973,121789,153001,153191,160253,178697,181303,
%U A109567 189067,190921,191353,195599,203057,204173,214993,220063,221101,227303,231719,233777,237409,243709
%N A109567 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 13.
%t A109567 a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 13, Prime[n], {}], {n, 1, 10000}]]
%Y A109567 Cf. A000040, A000720, A001359.
%Y A109567 Cf. A109556-A109569 for m = 2..15.
%K A109567 nonn,less
%O A109567 1,1
%A A109567 _Roger L. Bagula_, Jun 27 2005
%E A109567 Name edited, offset corrected and more terms added by _Amiram Eldar_, Jun 02 2025