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 A362011 #13 Dec 02 2023 09:13:45
%S A362011 6,12,15,18,21,22,24,26,30,34,36,38,42,44,45,46,48,52,54,55,58,60,62,
%T A362011 63,65,66,68,72,74,75,76,77,78,82,84,85,86,88,90,91,92,94,95,96,102,
%U A362011 104,105,106,108,110,114,115,116,118,119,120,122,124,126,130,132,133,134,135,136,138,142,144,145,146
%N A362011 Numbers k such that 1 < gcd(k, 70) < k and A007947(k) does not divide 70.
%C A362011 The asymptotic density of this sequence is 23/35. - _Amiram Eldar_, Dec 02 2023
%H A362011 Michael De Vlieger, <a href="/A362011/b362011.txt">Table of n, a(n) for n = 1..10000</a>
%H A362011 Michael De Vlieger, <a href="/A362011/a362011.png">Diagram showing numbers k in this sequence</a> instead as k mod 70 arranged in rows, labeled and in large black circles, else gray dots if coprime to 70, purple if k = 1, red if k | 70, and gold if rad(k) | 70.
%F A362011 This sequence is { N \ { A108513 U A235583 } }.
%t A362011 With[{n = 70}, Select[Range[200], And[! CoprimeQ[#, n], ! Divisible[n, Times @@ FactorInteger[#][[All, 1]]]] & ] ]
%Y A362011 Cf. A007947, A108513, A235583.
%K A362011 nonn
%O A362011 1,1
%A A362011 _Michael De Vlieger_, Apr 04 2023