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 A324862 #6 Mar 27 2019 18:56:08 %S A324862 0,0,0,1,0,1,0,0,3,0,0,1,0,1,4,4,0,3,0,0,5,1,0,0,0,1,4,1,0,4,0,4,0,1, %T A324862 5,4,0,1,7,0,0,5,0,1,4,1,0,4,0,0,2,1,0,4,6,0,9,1,0,0,0,1,5,6,0,1,0,1, %U A324862 0,5,0,5,0,1,5,1,6,7,0,4,0,1,0,1,8,1,11,0,0,6,7,1,0,1,9,5,0,1,7,5,0,2,0,0,6 %N A324862 a(n) is the binary length of A324878(n). %H A324862 Antti Karttunen, <a href="/A324862/b324862.txt">Table of n, a(n) for n = 1..10000</a> %H A324862 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A324862 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A324862 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A324862 If A324878(n) = 0, a(n) = 0, otherwise a(n) = A070939(A324878(n)) = 1 + A000523(A324878(n)). %F A324862 a(p) = 0 for all primes p. %o A324862 (PARI) A324862(n) = #binary(A324878(n)); \\ Needs also code from A324878. %Y A324862 Cf. A000040, A000523, A070939, A324878, A324861, A324864, A324874. %K A324862 nonn %O A324862 1,9 %A A324862 _Antti Karttunen_, Mar 21 2019