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 A336120 #13 Jul 17 2020 22:57:27 %S A336120 0,0,0,1,0,2,0,2,0,4,0,4,0,8,0,5,0,5,0,8,0,16,0,10,1,32,0,16,0,10,0, %T A336120 11,0,64,2,8,0,128,0,20,0,20,0,32,0,256,0,22,0,8,0,64,0,11,4,40,0,512, %U A336120 0,16,0,1024,0,22,8,40,0,128,0,16,0,20,0,2048,1,256,0,80,0,44,0,4096,0,32,16,8192,0,80,0,22,0,512,0,16384,32,44,0,17,0,17,0 %N A336120 a(n) = A292383(A122111(n)). %H A336120 Antti Karttunen, <a href="/A336120/b336120.txt">Table of n, a(n) for n = 1..8192</a> %H A336120 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A336120 a(1) = 0, and for n > 1, a(n) = [A122111(n) == 3 (mod 4)] + 2*a(A253553(n)). %F A336120 a(n) = A292383(A122111(n)). %F A336120 a(n) = A253566(n) - A336125(n). %F A336120 A000120(a(n)) = A336121(n). %o A336120 (PARI) %o A336120 \\ Uses also code given in A336124: %o A336120 A253553(n) = if(n<=2,1,my(f=factor(n), k=#f~); if(f[k,2]>1,f[k,2]--,f[k,1] = precprime(f[k,1]-1)); factorback(f)); %o A336120 A336120(n) = if(1==n,0,(3==A336124(n))+(2*A336120(A253553(n)))); %Y A336120 Cf. A064989, A122111, A252463, A253553, A253566, A292383, A336121, A336124, A336125, A336312. %Y A336120 Cf. A336119 (positions of zeros). %K A336120 nonn %O A336120 1,6 %A A336120 _Antti Karttunen_, Jul 14 2020