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 A324881 #9 Mar 27 2019 18:57:21 %S A324881 0,0,0,0,0,0,0,0,1,0,0,0,0,0,3,2,0,0,0,0,4,0,0,0,0,0,2,0,0,0,0,0,0,0, %T A324881 3,2,0,0,5,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,4,0,7,0,0,0,0,0,1,3,0,0,0,0, %U A324881 0,0,0,3,0,0,4,0,5,0,0,0,2,0,0,0,6,0,9,0,0,4,5,0,0,0,8,2,0,0,5,3,0,0,0,0,4 %N A324881 Number of nonleading zeros in binary representation of A324398, where A324398(n) = A156552(n) AND (A323243(n) - A156552(n)). %H A324881 Antti Karttunen, <a href="/A324881/b324881.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552) %H A324881 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A324881 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A324881 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A324881 a(n) = A080791(A324398(n)) = A324874(n) - A324868(n). %F A324881 a(p) = 0 for all primes p. %e A324881 For n=4, A324398(4) = 1, in binary "1", thus a(4) = 0. %e A324881 For n=9, A324398(9) = 6, in binary "110", thus a(9) = 1. %e A324881 For n=16, A324398(16) = 9, in binary "1001", thus a(16) = 2. %o A324881 (PARI) A324881(n) = (A324874(n)-A324868(n)); %Y A324881 Cf. A080791, A156552, A323243, A324398, A324868, A324874. %K A324881 nonn %O A324881 1,15 %A A324881 _Antti Karttunen_, Mar 27 2019