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 A331175 #8 Jan 11 2020 21:50:24
%S A331175 1,1,1,2,1,2,1,3,3,2,1,4,1,2,1,4,1,5,1,3,3,2,1,6,4,2,7,4,1,2,1,5,1,2,
%T A331175 1,8,1,2,3,5,1,5,1,3,3,2,1,9,6,6,1,4,1,10,4,7,3,2,1,4,1,2,8,6,1,2,1,3,
%U A331175 1,2,1,11,1,2,5,4,1,5,1,7,12,2,1,9,1,2,1,5,1,6,1,3,3,2,1,13,1,10,3,8,1,2,1,6,3
%N A331175 Number of values of k, 1 <= k <= n, with A109395(k) = A109395(n), where A109395(n) = n/gcd(n, phi(n)).
%C A331175 Ordinal transform of A109395.
%H A331175 Antti Karttunen, <a href="/A331175/b331175.txt">Table of n, a(n) for n = 1..65537</a>
%F A331175 For n >= 1, a(2^n) = n, a(A003277(n)) = 1.
%o A331175 (PARI)
%o A331175 up_to = 65537;
%o A331175 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 A331175 A109395(n) = n/gcd(n, eulerphi(n));
%o A331175 v331175 = ordinal_transform(vector(up_to, n, A109395(n)));
%o A331175 A331175(n) = v331175[n];
%Y A331175 Cf. A000010, A003277, A009195, A109395.
%Y A331175 Cf. also A081373, A330746, A331177.
%K A331175 nonn
%O A331175 1,4
%A A331175 _Antti Karttunen_, Jan 11 2020