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 A322813 #8 Dec 27 2018 22:05:03
%S A322813 1,1,1,2,1,2,1,2,3,2,1,2,1,2,3,2,1,4,1,2,3,2,1,2,4,2,3,2,1,4,1,2,3,2,
%T A322813 4,4,1,2,3,2,1,4,1,2,3,2,1,2,5,6,3,2,1,4,4,2,3,2,1,4,1,2,3,2,4,4,1,2,
%U A322813 3,6,1,4,1,2,6,2,5,4,1,2,3,2,1,4,4,2,3,2,1,4,5,2,3,2,4,2,1,8,3,6,1,4,1,2,6
%N A322813 a(n) = A001227(A122111(n)).
%H A322813 Antti Karttunen, <a href="/A322813/b322813.txt">Table of n, a(n) for n = 1..20000</a>
%H A322813 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A322813 a(n) = A001227(A122111(n)).
%o A322813 (PARI)
%o A322813 A001227(n) = numdiv(n>>valuation(n, 2));
%o A322813 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 A322813 A122111(n) = if(1==n,n,prime(bigomega(n))*A122111(A064989(n)));
%o A322813 A322813(n) = A001227(A122111(n));
%Y A322813 Cf. A001227, A122111, A322819.
%K A322813 nonn
%O A322813 1,4
%A A322813 _Antti Karttunen_, Dec 27 2018