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 A324119 #7 Feb 23 2019 07:22:32
%S A324119 0,1,1,1,1,1,1,2,1,1,1,1,1,2,2,1,1,1,1,2,2,1,1,2,2,2,2,1,2,1,1,2,2,2,
%T A324119 1,1,1,3,2,1,1,1,1,2,2,1,1,2,1,3,1,1,1,2,1,3,2,1,1,1,2,2,2,2,2,1,2,2,
%U A324119 1,1,2,1,2,2,2,2,2,1,1,3,2,1,2,3,3,3,2,1,2,2,2,3,3,3,2,1,1,3,2,1,2,1,1,3,1,1,1,1,1,3,2,1,2,3,2,2,2,2,2,2
%N A324119 a(n) = A001221(A156552(n)).
%H A324119 Antti Karttunen, <a href="/A324119/b324119.txt">Table of n, a(n) for n = 2..4473</a>
%H A324119 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A324119 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%o A324119 (PARI)
%o A324119 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 A324119 A156552(n) = if(1==n, 0, if(!(n%2), 1+(2*A156552(n/2)), 2*A156552(A064989(n))));
%o A324119 A324119(n) = if(1==n,0,omega(A156552(n)));
%Y A324119 Cf. A001221, A156552.
%Y A324119 Cf. also A323243, A324104, A324105, A324117 (sigma, phi, tau and number of odd divisors (A001227) similarly permuted).
%Y A324119 Cf. also A322812.
%K A324119 nonn
%O A324119 2,8
%A A324119 _Antti Karttunen_, Feb 21 2019