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 A307589 #17 Sep 07 2022 16:00:53
%S A307589 10,14,15,20,21,28,30,40,42,45,50,55,56,60,63,65,70,75,77,80,84,85,90,
%T A307589 91,95,98,100,105,110,112,115,119,120,126,130,133,135,140,145,147,150,
%U A307589 154,155,160,161,165,168,170,180,182,185,189,190,195,196,200,203,205
%N A307589 Numbers m such that 1 < gcd(m, 35) < m and m does not divide 35^e for e >= 0.
%C A307589 Complement of the union of A003595 and A235933.
%C A307589 Analogous to A081062 and A105115 for terms 1 and 2 of A120944. This sequence applies to A120944(6) = 35.
%H A307589 Michael De Vlieger, <a href="/A307589/b307589.txt">Table of n, a(n) for n = 1..10000</a>
%F A307589 a(n) = 35n/11 + O(log^2 n). - _Charles R Greathouse IV_, Sep 07 2022
%e A307589 10 is in the sequence since gcd(10, 35) = 5 and 10 does not divide 35^e with integer e >= 0.
%e A307589 2 is not in the sequence since 2 is coprime to 35.
%e A307589 7 is not in the sequence since 7 | 35.
%e A307589 25 is not in the sequence since 25 | 35^2.
%t A307589 With[{nn = 205, k = 35}, Select[Range@ nn, And[1 < GCD[#, k] < #, PowerMod[k, Floor@ Log2@ nn, #] != 0] &]]
%o A307589 (PARI) is(n)=gcd(n,35)>1 && n/5^valuation(n,5)/7^valuation(n,7)>1 \\ _Charles R Greathouse IV_, Sep 07 2022
%Y A307589 Cf. A003595, A081062, A105115, A120944, A235933, A306999.
%K A307589 nonn,easy
%O A307589 1,1
%A A307589 _Michael De Vlieger_, Aug 22 2019