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 A330137 #9 Dec 16 2019 11:48:15
%S A330137 14,21,22,26,28,33,34,35,38,39,42,44,46,51,52,55,56,57,58,62,63,65,66,
%T A330137 68,69,70,74,76,78,82,84,85,86,87,88,92,93,94,95,98,99,102,104,105,
%U A330137 106,110,111,112,114,115,116,117,118,122,123,124,126,129,130,132,134
%N A330137 Numbers m such that 1 < gcd(m, 30) < m and m does not divide 30^e for e >= 0.
%C A330137 Numbers m that are neither 5-smooth nor reduced residues mod 30. Such numbers m have at least 1 prime factor p <= 5 and at least 1 prime factor q > 5.
%C A330137 Complement of the union of A007775 and A051037.
%C A330137 Analogous to A105115 for A120944(2) = 10. This sequence applies to the second primorial in A120944, i.e., 30 = A002110(2).
%H A330137 Michael De Vlieger, <a href="/A330137/b330137.txt">Table of n, a(n) for n = 1..10000</a>
%e A330137 14 is in the sequence since gcd(14, 30) = 2 and 14 does not divide 30^e with integer e >= 0.
%e A330137 15 is not in the sequence since 15 | 30.
%e A330137 16 is not in the sequence since 16 | 30^4.
%e A330137 17 is not in the sequence since 17 is coprime to 30.
%t A330137 With[{nn = 135, k = 30}, Select[Range@ nn, And[1 < GCD[#, k] < #, PowerMod[k, Floor@ Log2@ nn, #] != 0] &]]
%Y A330137 Cf. A002110, A007775, A051037, A105115, A120944, A306999, A307589, A316991, A316992, A330136.
%K A330137 nonn,easy
%O A330137 1,1
%A A330137 _Michael De Vlieger_, Dec 02 2019