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 A109566 #8 Jun 03 2025 01:07:53
%S A109566 16141,36389,37907,69263,73189,86629,95651,103237,112691,126859,
%T A109566 130873,132763,152311,153763,159233,166487,167809,171947,200513,
%U A109566 202129,212297,213659,223151,223849,227893,236813,250199,255259,261169,277099,277429,283211,293543,302053
%N A109566 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 12.
%t A109566 a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 12, Prime[n], {}], {n, 1, 10000}]]
%t A109566 Table[If[Floor[2*Mod[(Prime[n+1]-Prime[n])*PrimePi[n]/n,8]]==12,Prime[n],Nothing],{n,10000}] (* _Harvey P. Dale_, Dec 16 2024 *)
%Y A109566 Cf. A000040, A000720, A001359.
%Y A109566 Cf. A109556-A109569 for m = 2..15.
%K A109566 nonn,less
%O A109566 1,1
%A A109566 _Roger L. Bagula_, Jun 27 2005
%E A109566 Name edited, offset corrected and more terms added by _Amiram Eldar_, Jun 02 2025