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 A365783 #10 Sep 19 2023 13:49:07 %S A365783 6,6,10,6,14,6,10,22,15,6,10,26,6,14,30,21,34,6,15,38,10,42,22,30,46, %T A365783 6,14,33,10,26,6,14,58,39,30,62,42,66,15,34,70,6,21,74,30,38,51,78,10, %U A365783 6,82,42,57,86,35,22,30,46,94,21,6,14,66,10,102,69,26,106 %N A365783 a(n) = squarefree kernel of A126706(n). %C A365783 Terms are squarefree and composite, i.e., in A120944. %H A365783 Michael De Vlieger, <a href="/A365783/b365783.txt">Table of n, a(n) for n = 1..10000</a> %F A365783 a(n) = A007947(A126706(n)). %e A365783 Let b(n) = A126706(n) and let squarefree kernel rad(n) = A007947(n). %e A365783 a(1) = 6 = rad(b(1)) = rad(12). %e A365783 a(2) = 6 = rad(b(2)) = rad(18). %e A365783 a(3) = 10 = rad(b(3)) = rad(20), etc. %t A365783 Map[Times @@ FactorInteger[#][[All, 1]] &, Select[Range[12, 212], Nor[PrimePowerQ[#], SquareFreeQ[#]] &] ] %o A365783 (PARI) apply(x->(x/factorback(factorint(x)[, 1])), select(x->(!issquarefree(x) && !isprimepower(x)), [1..1000])) \\ _Michel Marcus_, Sep 19 2023 %Y A365783 Cf. A007947, A120944, A126706, A365784, A365785. %K A365783 nonn %O A365783 1,1 %A A365783 _Michael De Vlieger_, Sep 19 2023