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 A065200 #15 Mar 19 2025 08:30:03
%S A065200 1,2,3,4,5,6,7,8,9,10,11,13,14,15,16,17,18,19,21,22,23,25,26,27,29,30,
%T A065200 31,32,33,34,35,37,38,39,41,42,43,46,47,49,50,51,53,54,55,57,58,59,61,
%U A065200 62,64,65,66,67,69,70,71,73,74,75,77,78,79,81,82,83,85,86,87,89,91,93
%N A065200 Numbers of the form m * p^k, with p prime, k >= 0, m squarefree and p > any prime factor of m.
%C A065200 This sequence does not contain any arithmetic progression. The first 24 terms coincide with A053460.
%H A065200 Amiram Eldar, <a href="/A065200/b065200.txt">Table of n, a(n) for n = 1..10000</a>
%e A065200 a(17) = 18 = 2 * 3^2, whereas A065201(4) = 28 = 2^2 * 7 as 2 < 7.
%t A065200 q[k_] := Max[Most[FactorInteger[k][[;;, 2]]]] < 2; Select[Range[100], q] (* _Amiram Eldar_, Mar 19 2025 *)
%o A065200 (PARI) isok(k) = {my(e = factor(k)[,2]); #e < 2 || vecmax(e[1..#e-1]) == 1;} \\ _Amiram Eldar_, Mar 19 2025
%Y A065200 Cf. A005117, A065201, A065202.
%K A065200 nonn
%O A065200 1,2
%A A065200 _Reinhard Zumkeller_, Oct 21 2001
%E A065200 Edited by _Franklin T. Adams-Watters_, Oct 27 2006