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 A304728 #10 May 19 2018 12:39:15 %S A304728 1,2,3,2,4,5,6,5,7,8,2,9,10,3,11,12,13,4,14,15,16,17,18,19,15,20,21, %T A304728 16,22,23,24,5,25,26,7,27,28,29,6,30,31,2,32,33,9,34,35,36,12,37,38,3, %U A304728 39,40,10,41,42,43,11,44,45,46,47,48,49,50,51,52,53,54,4,55,56,8,57,58,59,13,60,61,62,15,63,64,20,65,66,67,23,68,69,16,70,71,21 %N A304728 Restricted growth sequence transform of A246277(A303751(n)). %C A304728 For all i, j: a(i) = a(j) => A304729(i) = A304729(j). %H A304728 Antti Karttunen, <a href="/A304728/b304728.txt">Table of n, a(n) for n = 1..76503</a> %H A304728 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %o A304728 (PARI) %o A304728 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 A304728 A246277(n) = { if(1==n, 0, while((n%2), n = A064989(n)); (n/2)); }; %o A304728 rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; }; %o A304728 v304728 = rgs_transform(vector(76503,n,A246277(A303751(n)))); \\ Needs also code from A303751 %o A304728 A304728(n) = v304728[n]; %Y A304728 Cf. A246277, A303751, A304729, A304731. %K A304728 nonn %O A304728 1,2 %A A304728 _Antti Karttunen_, May 19 2018