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 A069189 #18 Oct 05 2023 18:16:56 %S A069189 4,8,9,12,16,18,25,27,32,36,45,48,49,50,54,63,64,72,75,80,81,96,98, %T A069189 100,108,112,121,125,128,144,147,150,160,162,169,175,176,180,192,196, %U A069189 200,208,216,224,225,240,242,243,245,250,252,256,275,288,289,294,300,320 %N A069189 Numbers k such that A007913(k) < sqrt(k). %C A069189 Equivalently, numbers k whose squarefree part, A007913(k), is smaller than their square part, A008833(k). - _Peter Munn_, Mar 26 2021 %H A069189 Amiram Eldar, <a href="/A069189/b069189.txt">Table of n, a(n) for n = 1..10000</a> %H A069189 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquarePart.html">Square Part</a>. %H A069189 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquarefreePart.html">Squarefree Part</a>. %t A069189 f[p_, e_] := If[OddQ[e], p, 1]; sqf[n_] := Times @@ (f @@@ FactorInteger[n]); Select[Range[320], sqf[#] < Sqrt[#] &] (* _Amiram Eldar_, Apr 02 2020 *) %o A069189 (PARI) for(n=1,200,if(core(n)<sqrt(n),print1(n,","))) %Y A069189 Cf. A007913, A008833. %Y A069189 Subsequence of A048098. %Y A069189 A116882 is a near equivalent with respect to a number's odd part. %K A069189 easy,nonn %O A069189 1,1 %A A069189 _Benoit Cloitre_, Apr 10 2002