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 A304742 #7 May 18 2018 19:45:44 %S A304742 1,2,3,2,4,5,2,6,7,3,2,8,9,2,10,11,4,12,13,6,14,15,2,2,16,17,7,2,18, %T A304742 19,2,20,21,5,3,4,22,23,2,24,25,26,2,27,28,8,10,29,30,15,31,32,3,2,33, %U A304742 34,11,2,35,36,2,37,38,14,2,39,40,17,16,41,42,12,4,6,8,43,44,6,45,46,10,47,48,15,49,50,2,51,52 %N A304742 Restricted growth sequence transform of A246277(A280866(n)). %C A304742 For all i, j: a(i) = a(j) => A304743(i) = A304743(j). %H A304742 Antti Karttunen, <a href="/A304742/b304742.txt">Table of n, a(n) for n = 1..65539</a> %H A304742 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %o A304742 (PARI) %o A304742 \\ Needs also code from A280866: %o A304742 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 A304742 A246277(n) = { if(1==n, 0, while((n%2), n = A064989(n)); (n/2)); }; %o A304742 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 A304742 v304742 = rgs_transform(vector(65539,n,A246277(A280866(n)))); %o A304742 A304742(n) = v304742[n]; %Y A304742 Cf. A246277, A280866, A304743. %K A304742 nonn %O A304742 1,2 %A A304742 _Antti Karttunen_, May 18 2018