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 A093109 #23 Oct 24 2017 02:27:54 %S A093109 2,4,6,8,16,18,32,42,52,54,55,64,93,128,162,171,256,272,294,355,406, %T A093109 486,506,512,605,676,820,1024,1332,1458,1474,1711,1806,1830,2048,2058, %U A093109 2162,2504,2525,2715,2756,2883,2943,3081,3249,3629,3916,4096,4374,4624,5210 %N A093109 Numbers n such that the Zsigmondy number Zs(n,5,1) differs from the n-th cyclotomic polynomial evaluated at 5. %C A093109 Numbers n such that A019323(n) does not equal A064081(n). %C A093109 _Vladeta Jovovic_ points out that the sequence seems to contain the powers of two as well as the numbers of the form 2*3^k. %C A093109 Numbers of the form ord(5,p)*p^k where prime p <> 5 and k > 0. Also numbers n > 0 such that A019323(n) =/= 1 (mod n). Also A019323(n) mod n = gcd(n, A019323(n)) = p. - _Thomas Ordowski_, Oct 22 2017 %t A093109 Select[Range[10000], GCD[#, Cyclotomic[#, 5]]!=1 &] (* _Emmanuel Vantieghem_, Nov 13 2016 *) %Y A093109 Cf. A093106, A093107, A093108, A019323, A064081. %K A093109 nonn %O A093109 1,1 %A A093109 _Ralf Stephan_, Mar 20 2004 %E A093109 More terms from _Vladeta Jovovic_, Apr 02 2004 %E A093109 Definition corrected by _Jerry Metzger_, Nov 04 2009