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 A330751 #9 Dec 30 2019 20:08:59
%S A330751 1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,
%T A330751 2,3,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,1,1,1,1,2,1,1,
%U A330751 1,2,1,1,1,1,2,1,2,2,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,2,1,1,3
%N A330751 Number of values of k, 1 <= k <= n, with A319626(k) = A319626(n), where A319626(n) gives the numerator of rational valued primorial deflation of n.
%C A330751 Ordinal transform of A319626.
%H A330751 Antti Karttunen, <a href="/A330751/b330751.txt">Table of n, a(n) for n = 1..65537</a>
%o A330751 (PARI)
%o A330751 up_to = 65537;
%o A330751 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 A330751 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 A330751 A319626(n) = (n / gcd(n, A064989(n)));
%o A330751 v330751 = ordinal_transform(vector(up_to, n, A319626(n)));
%o A330751 A330751(n) = v330751[n];
%Y A330751 Cf. A064989, A319626, A330750, A330752.
%K A330751 nonn
%O A330751 1,6
%A A330751 _Antti Karttunen_, Dec 30 2019