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 A069043 #28 Jun 09 2022 06:32:08
%S A069043 385,455,595,665,805,1015,1085,1925,2275,2695,2975,3185,3325,4025,
%T A069043 4165,4235,4655,5005,5075,5425,5635,5915,6545,7105,7315,7595,7735,
%U A069043 8645,8855,9625,10115,10465,11165,11305,11375,11935,12155,12635,13195,13475
%N A069043 Composite numbers k with no prime factor among (2, 3) (cf. A038509) and such that phi(k) < 2*k/3.
%C A069043 Almost all composite numbers k such that phi(k) > 2k/3 have no prime factor among 2 and 3.
%H A069043 Marius A. Burtea, <a href="/A069043/b069043.txt">Table of n, a(n) for n = 1..10000</a>
%F A069043 A038509 SETMINUS A067793: numbers in A038509 but not in A067793.
%t A069043 Select[Flatten @ Table[6*n + {1, 5}, {n, 0, 2500}], CompositeQ[#] && EulerPhi[#] < 2*#/3 &] (* _Amiram Eldar_, Jun 09 2022 *)
%o A069043 (PARI) lista(nn) = {forcomposite(n=1, nn, if ((gcd(n, 6) == 1) && (n/eulerphi(n) > 3/2), print1(n, ", ")););} \\ _Michel Marcus_, Jul 05 2015
%o A069043 (Magma) [k:k in [1..14000]| not IsPrime(k) and Gcd(6,k) eq 1 and EulerPhi(k) lt 2*k/3]; // _Marius A. Burtea_, Oct 01 2019
%Y A069043 Cf. A000010, A038509, A067793.
%K A069043 easy,nonn
%O A069043 1,1
%A A069043 _Benoit Cloitre_, Apr 03 2002