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 A294904 #10 Jul 20 2023 07:01:27
%S A294904 0,0,0,1,0,1,0,2,1,1,0,3,0,1,1,3,0,3,0,3,1,1,0,5,0,1,2,3,0,4,0,4,1,1,
%T A294904 1,6,0,1,1,5,0,4,0,3,3,1,0,7,1,2,1,3,0,5,1,5,1,1,0,8,0,1,3,5,1,4,0,3,
%U A294904 1,4,0,9,0,1,2,3,1,4,0,7,3,1,0,8,1,1,1,5,0,8,1,3,1,1,0,9,0,3,3,5,0,4,0,5,4,1,0,9,0,4,0,7,0,4,1,3,3,1,0,12
%N A294904 Number of divisors of n that are in A175526.
%C A294904 Number of terms of A175526 that divide n.
%H A294904 Antti Karttunen, <a href="/A294904/b294904.txt">Table of n, a(n) for n = 1..25000</a>
%F A294904 a(n) = Sum_{d|n} (1-A294905(d)).
%F A294904 a(n) = 1 + (A294902(n)-A294905(n)).
%F A294904 a(n) + A294903(n) = A000005(n).
%t A294904 q[n_] := DivisorSum[n, DigitCount[#, 2, 1] &] > 2 * DigitCount[n, 2, 1]; a[n_] := DivisorSum[n, 1 &, q[#] &]; Array[a, 100] (* _Amiram Eldar_, Jul 20 2023 *)
%o A294904 (PARI)
%o A294904 A292257(n) = sumdiv(n,d,(d<n)*hammingweight(d));
%o A294904 A294905(n) = (A292257(n) <= hammingweight(n));
%o A294904 A294904(n) = sumdiv(n,d,(0==A294905(d)));
%Y A294904 Cf. A000120, A175526, A292257, A294901, A294902, A294903, A294905.
%Y A294904 Cf. also A294894.
%K A294904 nonn,base
%O A294904 1,8
%A A294904 _Antti Karttunen_, Nov 10 2017