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 A331177 #5 Jan 11 2020 21:50:37 %S A331177 1,1,1,1,1,2,1,1,1,2,1,2,1,2,1,1,1,2,1,3,3,2,1,1,1,2,1,1,1,2,1,1,1,2, %T A331177 1,3,1,2,3,1,1,4,1,1,1,2,1,2,1,2,1,4,1,2,3,2,3,2,1,4,1,2,1,1,1,2,1,3, %U A331177 1,2,1,3,1,2,3,1,1,5,1,3,1,2,1,5,1,2,1,1,1,2,1,1,3,2,1,1,1,2,1,4,1,2,1,1,3 %N A331177 Number of values of k, 1 <= k <= n, with A319677(k) = A319677(n), where A319677(n) = n/gcd(n, uphi(n)), and uphi is unitary totient function (A047994). %C A331177 Ordinal transform of A319677. %H A331177 Antti Karttunen, <a href="/A331177/b331177.txt">Table of n, a(n) for n = 1..65537</a> %o A331177 (PARI) %o A331177 up_to = 65537; %o A331177 ordinal_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), pt); for(i=1, length(invec), if(mapisdefined(om,invec[i]), pt = mapget(om, invec[i]), pt = 0); outvec[i] = (1+pt); mapput(om,invec[i],(1+pt))); outvec; }; %o A331177 A047994(n) = { my(f=factor(n)); prod(i=1, #f~, (f[i, 1]^f[i, 2])-1); }; %o A331177 A319677(n) = n/gcd(n, A047994(n)); %o A331177 v331177 = ordinal_transform(vector(up_to, n, A319677(n))); %o A331177 A331177(n) = v331177[n]; %Y A331177 Cf. A047994, A319677. %Y A331177 Cf. also A330739, A331175. %K A331177 nonn %O A331177 1,6 %A A331177 _Antti Karttunen_, Jan 11 2020