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 A119905 #23 May 09 2024 09:07:43 %S A119905 1,2,4,5,7,8,10,11,13,14,16,17,19,20,23,25,26,28,29,31,32,34,35,37,38, %T A119905 40,41,43,46,47,49,50,52,53,55,56,58,59,61,62,64,65,67,68,70,71,73,74, %U A119905 76,77,79,80,82,83,85,86,89,91,92,94,95,97,98,100,101,103,104,106,107 %N A119905 Numbers k such that gcd(k, R_k) = 1, where R_k is the repunit (10^k -1)/9 = A002275(k). %H A119905 T. D. Noe, <a href="/A119905/b119905.txt">Table of n, a(n) for n = 1..1000</a> %t A119905 Select[Range[1000], GCD[#, (10^# - 1)/9] == 1&] (* _Jean-François Alcover_, May 19 2016 *) %o A119905 (PARI) upto(N) = [n|n<-[1..N], 1==gcd(n, (10^n-1)/9)]; \\ _Ruud H.G. van Tol_, May 09 2024 %Y A119905 Cf. A002275, A119888. %K A119905 nice,nonn %O A119905 1,2 %A A119905 _Lekraj Beedassy_, Aug 03 2006