cp's OEIS Frontend

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.

A109565 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 11.

This page as a plain text file.
%I A109565 #5 Jun 03 2025 01:08:04
%S A109565 5591,8467,9551,9973,12853,14107,15823,19333,20809,22573,25261,33247,
%T A109565 34981,38461,38501,39251,45439,52391,58789,76163,81463,91033,93001,
%U A109565 93637,101221,103723,105769,106543,113233,113843,116593,118297,124021,128053,128767,137029,156371
%N A109565 prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 11.
%t A109565 a = Flatten[Table[If[Floor[2*Mod[(Prime[n + 1] - Prime[n])*PrimePi[n]/n, 8]] == 11, Prime[n], {}], {n, 1, 4000}]]
%Y A109565 Cf. A000040, A000720, A001359.
%Y A109565 Cf. A109556-A109569 for m = 2..15.
%K A109565 nonn,less
%O A109565 1,1
%A A109565 _Roger L. Bagula_, Jun 27 2005
%E A109565 Name edited, offset corrected and more terms added by _Amiram Eldar_, Jun 02 2025