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 A340683 #10 Feb 14 2021 18:40:02
%S A340683 0,1,0,0,1,2,0,2,0,0,2,0,0,1,1,0,1,1,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,0,
%T A340683 2,0,0,0,0,0,1,1,3,1,3,1,1,0,0,1,4,0,0,1,0,1,1,1,0,2,2,0,0,0,1,0,0,2,
%U A340683 0,0,0,1,1,3,0,1,1,2,2,2,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,1,0,2,1,0,3,0,0,3,1
%N A340683 a(n) = A007949((A003961(A003961(n))+1)/2), where A003961 shifts the prime factorization of n one step towards larger primes, and A007949(x) gives the exponent of largest power of 3 dividing x.
%H A340683 Antti Karttunen, <a href="/A340683/b340683.txt">Table of n, a(n) for n = 1..65537</a>
%H A340683 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%F A340683 a(n) = A292251(A003961(n)) = A007949(A048673(A003961(n))).
%o A340683 (PARI)
%o A340683 A003961(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; \\ From A003961
%o A340683 A340683(n) = valuation((A003961(A003961(n))+1)/2, 3);
%Y A340683 Cf. A003961, A007949, A048673, A292251, A341347.
%K A340683 nonn
%O A340683 1,6
%A A340683 _Antti Karttunen_, Feb 14 2021