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 A109569 #6 Jun 03 2025 01:07:36
%S A109569 19609,25471,35617,44293,58831,89689,107377,162143,218287,253159,
%T A109569 290249,302329,360091,404597,507217,514967,517639,531383,570253,
%U A109569 619397,621143,639757,642281,673669,716173,736279,794249,795349,815729,873787,912649,933073,937253,1013063
%N A109569 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 15.
%t A109569 a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 15, Prime[n], {}], {n, 1, 10000}]]
%Y A109569 Cf. A000040, A000720, A001359.
%Y A109569 Cf. A109556-A109569 for m = 2..15.
%K A109569 nonn,less
%O A109569 1,1
%A A109569 _Roger L. Bagula_, Jun 27 2005
%E A109569 Name edited, offset corrected and more terms added by _Amiram Eldar_, Jun 02 2025