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 A334108 #8 May 01 2020 08:02:08
%S A334108 0,0,0,1,0,1,0,2,2,1,0,2,0,1,2,1,0,3,0,2,2,1,0,1,3,1,4,2,0,3,0,2,2,1,
%T A334108 3,2,0,1,2,1,0,3,0,2,4,1,0,2,4,4,2,2,0,3,3,1,2,1,0,2,0,1,4,2,3,3,0,2,
%U A334108 2,4,0,3,0,1,5,2,4,3,0,2,2,1,0,2,3,1,2,1,0,3,4,2,2,1,3,2,0,5,4,3,0,3,0,1,5
%N A334108 a(n) = A331410(A122111(n)).
%H A334108 Antti Karttunen, <a href="/A334108/b334108.txt">Table of n, a(n) for n = 1..65537</a>
%H A334108 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A334108 a(n) = A331410(A122111(n)) = A331410(A322865(n)).
%F A334108 a(n) = A331410(A105560(n)) + a(A064989(n)).
%o A334108 (PARI)
%o A334108 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 A334108 A122111(n) = if(1==n,n,prime(bigomega(n))*A122111(A064989(n)));
%o A334108 A331410(n) = if(!bitand(n,n-1),0,1+A331410(n+(n/vecmax(factor(n)[, 1]))));
%o A334108 A334108(n) = A331410(A122111(n));
%Y A334108 Cf. A008578 (positions of zeros), A064989, A105560, A122111, A322865, A331410, A334107.
%K A334108 nonn
%O A334108 1,8
%A A334108 _Antti Karttunen_, Apr 29 2020