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 A327861 #10 Sep 30 2019 03:15:52
%S A327861 0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,1,1,0,1,0,0,0,1,0,0,0,0,0,1,1,1,0,0,0,
%T A327861 0,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,1,0,0,0,0,1,0,1,0,0,0,0,0,1,0,
%U A327861 0,1,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,1,1,0,0,0,1,0,1,0,0
%N A327861 Number of divisors d of n for which A003415(d)*d is equal to n, where A003415(x) gives the arithmetic derivative of x.
%C A327861 Number of times n occurs in A190116.
%H A327861 Antti Karttunen, <a href="/A327861/b327861.txt">Table of n, a(n) for n = 1..65537</a>
%e A327861 a(4153248)=2 as out of 192 divisors of 4153248, only 1368 and 2277 are such that 1368 * A003415(1368) = 2277 * A003415(2277) = 4153248.
%o A327861 (PARI)
%o A327861 A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
%o A327861 A327861(n) = sumdiv(n,d,(d*A003415(d) == n));
%Y A327861 Cf. A003415, A190116.
%Y A327861 Cf. also A327153, A327166, A327169.
%K A327861 nonn
%O A327861 1,4153248
%A A327861 _Antti Karttunen_, Sep 28 2019