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 A344773 #9 Jun 30 2021 19:47:41
%S A344773 1,1,1,2,1,2,1,2,1,2,1,4,1,2,1,3,1,3,1,2,1,2,1,5,1,2,2,3,1,4,1,3,1,2,
%T A344773 1,6,1,2,1,4,1,3,1,1,2,2,1,7,1,2,2,3,1,4,1,4,1,2,1,7,1,2,1,4,2,4,1,2,
%U A344773 1,3,1,8,1,2,2,3,1,3,1,1,2,2,1,7,1,2,1,4,1,6,1,2,1,2,1,8,1,3,2,4,1,4,1,1,2
%N A344773 Number of divisors d of n for which A342915(d) = A342915(n), where A342915(n) = gcd(1+n, psi(n)).
%H A344773 Antti Karttunen, <a href="/A344773/b344773.txt">Table of n, a(n) for n = 1..65537</a>
%F A344773 a(n) = Sum_{d|n} [A342915(d) = A342915(n)], where [ ] is the Iverson bracket.
%F A344773 a(n) <= A344771(n).
%o A344773 (PARI)
%o A344773 A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
%o A344773 A342915(n) = gcd(1+n,A001615(n));
%o A344773 A344773(n) = { my(x=A342915(n)); sumdiv(n,d,A342915(d)==x); };
%Y A344773 Cf. A001615, A342915, A344771.
%Y A344773 Cf. also A344774.
%K A344773 nonn
%O A344773 1,4
%A A344773 _Antti Karttunen_, May 31 2021