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 A199799 #15 Feb 16 2025 08:33:16 %S A199799 1,2,4,5,8,10,16,17,19,20,23,25,29,31,32,34,38,40,41,43,46,47,50,53, %T A199799 58,59,61,62,64,67,68,71,73,76,79,80,82,83,85,86,89,92,94,95,97,100, %U A199799 101,103,106,107,109,113,115,116,118,122,124,125,127,128,131,134 %N A199799 Totatives of 111111. %C A199799 a(n) and 111111 are coprime, 111111 = 3*7*11*13*37; empty intersections with A008585, A008593, A008595, or A085959; sequence is finite with 51840 terms, A000010(111111) = 51840, last term: a(51840) = 111110. %H A199799 Reinhard Zumkeller, <a href="/A199799/b199799.txt">Table of n, a(n) for n = 1..10000</a> %H A199799 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a> %H A199799 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Totative.html">Totative</a> %t A199799 Select[Range[200],CoprimeQ[#,111111]&] (* _Paolo Xausa_, Sep 27 2023 *) %o A199799 (Haskell) %o A199799 a199799 n = a199799_list !! (n-1) %o A199799 a199799_list = [x | x <- [1..111111], gcd x 111111 == 1] %Y A199799 Cf. A109492 (divisors of 111111). %K A199799 nonn,fini %O A199799 1,2 %A A199799 _Reinhard Zumkeller_, Nov 11 2011