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 A324832 #6 Mar 16 2019 21:46:32 %S A324832 0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,2,0,1, %T A324832 0,1,0,0,0,3,0,1,0,1,0,1,0,1,0,0,0,0,0,1,0,1,0,0,0,3,0,0,0,3,0,0,0,1, %U A324832 0,0,0,2,0,0,0,0,0,0,0,4,0,1,0,1,0,0,0,2,0,2,0,1,0,0,0,2,0,0,0,1,0,1,0,1,0 %N A324832 Number of divisors d of n such that A323243(d) == 2 (mod 3). %H A324832 Antti Karttunen, <a href="/A324832/b324832.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552) %H A324832 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A324832 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A324832 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A324832 a(n) = A000005(n) - (A324830(n) + A324831(n)). %F A324832 a(p) = 0 for all primes p. %o A324832 (PARI) A324832(n) = sumdiv(n,d,(2==(A323243(d))%3)); %Y A324832 Cf. A000005, A000203, A156552, A323243, A324830, A324831. %K A324832 nonn %O A324832 1,32 %A A324832 _Antti Karttunen_, Mar 16 2019