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 A064126 #8 Jan 18 2019 13:56:37
%S A064126 3,2,2,2,4,4,4,4,2,2,4,2,8,2,4,4,4,4,2,4,8,8,2,2,8,4,4,8,32,8,8,32,4,
%T A064126 8,8,2,8,2,2,4,16,8,16,8,4,16,4,2,4,8,16,4,16,4,16,4,8,4,4,8,128,2,32,
%U A064126 16,4,4,8,8,8,4,4,8,8,8,8,4,16,16,64,4,32,4
%N A064126 Number of divisors of 10^n - 1 that are relatively prime to 10^m - 1 for all 0 < m < n.
%H A064126 Sam Wagstaff, Cunningham Project, <a href="https://homes.cerias.purdue.edu/~ssw/cun/">Factorizations of 10^n-1, n odd, n<300</a>
%t A064126 a = {1}; Do[ d = Divisors[ 10^n - 1 ]; l = Length[ d ]; c = 0; k = 1; While[ k < l + 1, If[ Union[ GCD[ a, d[ [ k ] ] ] ] == {1}, c++ ]; k++ ]; Print[ c ]; a = Union[ Flatten[ Append[ a, Transpose[ FactorInteger[ 10^n - 1 ] ][ [ 1 ] ] ] ] ], {n, 1, 61} ]
%o A064126 (PARI) a(n) = sumdiv(10^n-1, d, vecsum(vector(n-1, k, gcd(d, 10^k-1) == 1)) == n-1); \\ _Michel Marcus_, Jun 23 2018
%Y A064126 Cf. A063982.
%K A064126 nonn
%O A064126 1,1
%A A064126 _Robert G. Wilson v_, Sep 10 2001
%E A064126 a(62)-a(82) from _Giovanni Resta_, Jun 26 2018