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 A246419 #26 Sep 08 2022 08:46:09 %S A246419 10,22,50,143,204,267,311,312,423,455,461,479,506,556,579,600,649,818, %T A246419 845,889,987,1008,1104,1108,1134,1178,1258,1273,1333,1343,1416,1423, %U A246419 1467,1537,1610,1637,1712,1756,1779,2001,2005,2045,2065,2066,2104,2166,2205 %N A246419 Numbers n such that n^6 - 2 is not squarefree. %H A246419 Robert Israel, <a href="/A246419/b246419.txt">Table of n, a(n) for n = 1..10000</a> %e A246419 10^6 - 2 = 999998, which is divisible by 16129 = 127^2, so 10 is in the sequence. %e A246419 11^6 - 2 = 1771559, which is prime, and 12^6 - 2 = 2985982 = 2 * 17 * 31 * 2833 (all prime), so neither of these numbers is in the sequence. %p A246419 remove(t -> numtheory:-issqrfree(t^6-2), [$1..3000]); # _Robert Israel_, Aug 25 2014 %t A246419 Select[Range[2000], MoebiusMu[#^6 - 2] == 0 &] (* _Alonso del Arte_, Aug 25 2014 *) %o A246419 (Python) %o A246419 from sympy import factorint %o A246419 [i for i in range(1, 500) if any(v>1 for v in factorint(i**6-2).values())] %o A246419 (PARI) isok(n) = ! issquarefree(n^6-2); \\ _Michel Marcus_, Oct 11 2014 %o A246419 (Magma) [n: n in [0..3000] | not IsSquarefree(n^6-2)]; // _Vincenzo Librandi_, Oct 16 2014 %Y A246419 Cf. A005117, A013928. %K A246419 nonn %O A246419 1,1 %A A246419 _Mark E. Shoulson_, Aug 25 2014