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 A247676 #31 Oct 29 2023 14:18:15
%S A247676 65,119,155,209,245,299,335,371,407,425,497,515,533,551,605,623,695,
%T A247676 713,731,749,767,785,803,875,893,965,1001,1037,1055,1073,1127,1145,
%U A247676 1199,1235,1253,1271,1325,1343,1379,1397,1415,1469,1505,1541,1577,1595,1631,1649
%N A247676 Odd composite numbers congruent to 2 modulo 9.
%C A247676 Subsequence of A017185 (9n+2).
%C A247676 Composites == 11 mod 18. - _Robert Israel_, Sep 24 2014
%H A247676 Odimar Fabeny, <a href="/A247676/b247676.txt">Table of n, a(n) for n = 1..10000</a>
%p A247676 remove(isprime,[seq(18*k+11,k=1..1000)]); # _Robert Israel_, Sep 24 2014
%t A247676 Select[18Range[100] + 11, Not[PrimeQ[#]] &] (* _Alonso del Arte_, Sep 25 2014 *)
%t A247676 Select[Range[11,2000,18],CompositeQ] (* _Harvey P. Dale_, Oct 29 2023 *)
%o A247676 (PARI) lista(nn) = {forcomposite(n=1, nn, if ((n % 2) && ((n % 9) == 2), print1(n, ", ")););} \\ _Michel Marcus_, Sep 22 2014
%Y A247676 Cf. A017185, A247678, A247679, A247681, A247682, A247683.
%K A247676 nonn,easy
%O A247676 1,1
%A A247676 _Odimar Fabeny_, Sep 22 2014