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 A329036 #6 Nov 08 2019 18:16:09
%S A329036 1,2,1,1,1,4,1,1,3,2,1,2,1,2,2,1,1,2,1,6,2,2,1,2,1,2,1,3,1,8,1,1,2,2,
%T A329036 1,2,1,2,2,3,1,4,1,3,2,2,1,2,1,2,2,3,1,1,1,8,2,2,1,4,1,2,1,1,1,4,1,3,
%U A329036 2,4,1,2,1,2,6,3,1,4,1,3,1,2,1,12,1,2,2,4,1,4,1,3,2,2,1,2,1,1,1,1,1,4,1,4,4
%N A329036 Number of common divisors of n and A122111(n).
%H A329036 Antti Karttunen, <a href="/A329036/b329036.txt">Table of n, a(n) for n = 1..65537</a>
%H A329036 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A329036 a(n) = A000005(A280491(n)) = A000005(gcd(n, A122111(n))).
%F A329036 a(n) = 1+A001222(A329042(n)) = 1+A001222(A329043(n)).
%o A329036 (PARI)
%o A329036 A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
%o A329036 A122111(n) = if(1==n,n,prime(bigomega(n))*A122111(A064989(n)));
%o A329036 A280491(n) = gcd(n,A122111(n));
%o A329036 A329036(n) = numdiv(A280491(n));
%Y A329036 Cf. A000005, A001222, A122111, A280491, A329042, A329043.
%K A329036 nonn
%O A329036 1,2
%A A329036 _Antti Karttunen_, Nov 08 2019