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 A109557 #5 Jun 03 2025 01:08:37
%S A109557 37,43,67,151,157,167,173,233,251,257,263,271,331,353,367,373,383,433,
%T A109557 443,503,541,557,563,571,587,593,601,607,647,653,683,701,719,743,761,
%U A109557 911,929,983,1109,1163,1193,1373,1439,1523,1559,1571,1733,1823,1979
%N A109557 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 3.
%t A109557 a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 3, Prime[n], {}], {n, 1, 400}]]
%Y A109557 Cf. A000040, A000720, A001359.
%Y A109557 Cf. A109556-A109569 for m = 2..15.
%K A109557 nonn,less
%O A109557 1,1
%A A109557 _Roger L. Bagula_, Jun 27 2005
%E A109557 Name edited and offset corrected by _Amiram Eldar_, Jun 02 2025