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 A064122 #12 Jan 18 2019 13:56:37
%S A064122 2,1,2,2,3,2,2,2,2,2,4,2,2,2,2,4,4,4,4,2,2,4,4,2,4,2,8,4,8,4,8,2,2,8,
%T A064122 4,2,4,4,8,2,8,4,4,4,8,2,16,8,32,4,4,4,8,4,4,4,8,8,4,2,4,4,2,2,8,4,8,
%U A064122 4,4,2,2,2,16,8,8,4,8,16,8,4,8,4,16,4,4,2,8,8,8,4,4,4,4,8,4,4,8,4,4,8
%N A064122 Number of divisors of 3^n - 1 that are relatively prime to 3^m - 1 for all 0 < m < n.
%H A064122 Harry J. Smith, <a href="/A064122/b064122.txt">Table of n, a(n) for n = 1..167</a>
%H A064122 Sam Wagstaff, Cunningham Project, <a href="https://homes.cerias.purdue.edu/~ssw/cun/">Factorizations of 3^n-1, n odd, n<540</a>
%t A064122 a = {1}; Do[ d = Divisors[ 3^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[ 3^n - 1 ] ][ [ 1 ] ] ] ] ], {n, 1, 100} ]
%o A064122 (PARI) { allocatemem(932245000); for (n=1, 167, d=divisors(3^n - 1); l=length(d); a=0; for (i=1, l, t=1; for (m=1, n - 1, p=3^m - 1; if (gcd(d[i], p)!=1, t=0; break)); if (t, a++)); write("b064122.txt", n, " ", a) ) } \\ _Harry J. Smith_, Sep 08 2009
%Y A064122 Cf. A063982.
%K A064122 nonn
%O A064122 1,1
%A A064122 _Robert G. Wilson v_, Sep 10 2001