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 A054403 #20 Sep 10 2023 08:31:11
%S A054403 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,49,53,59,61,67,71,73,77,79,
%T A054403 83,89,91,97,101,103,107,109,113,119,121,127,131,133,137,139,143,149,
%U A054403 151,157,161,163,167,169,173,179,181,187,191,193,197,199,203,209,211
%N A054403 Result of third stage of sieve of Eratosthenes (after eliminating multiples of 2, 3 and 5).
%H A054403 Ahmed Hamdy A. Diab, <a href="https://arxiv.org/abs/2012.03052">Sequence eliminating law (SEL) and the interval formulas of prime numbers</a>, arXiv:2012.03052 [math.NT], 2020.
%H A054403 H. B. Meyer, <a href="http://www.hbmeyer.de/eratosiv.htm">Eratosthenes' sieve</a>
%H A054403 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 1, -1).
%F A054403 2, 3, 5 and numbers 30k +/- 1, 7, 11, or 13.
%F A054403 a(n+3) = 2*floor((3*floor((10*floor((9*n+1)/8)+8)/9)+1)/2)+1 for n>=1; see (19) in Diab link. - _Michel Marcus_, Dec 14 2020
%t A054403 Join[{2,3,5},Select[Table[n,{n,2,300}],Mod[#,2]!=0&&Mod[#,3]!=0&&Mod[#,5]!=0&]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 18 2011*)
%Y A054403 Cf. A000040, A004280, A038179, A055396, A055398, A055399.
%K A054403 nonn
%O A054403 1,1
%A A054403 _Henry Bottomley_, May 15 2000