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 A323878 #9 Feb 08 2019 00:10:11
%S A323878 0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,4,0,1,0,1,
%T A323878 0,4,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,4,0,1,0,1,0,3,0,1,
%U A323878 0,2,0,4,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0,1,0,7,0,1,0,1,0,3,0,1,0,1,0,3,0,1,0
%N A323878 Number of divisors d of n such that A276086(d) divides n.
%H A323878 Antti Karttunen, <a href="/A323878/b323878.txt">Table of n, a(n) for n = 1..30030</a>
%H A323878 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A323878 a(n) = Sum_{d|n} [A276086(d)|n], where [ ] is the Iverson bracket.
%o A323878 (PARI)
%o A323878 A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
%o A323878 A323878(n) = sumdiv(n,d,!(n%A276086(d)));
%Y A323878 Cf. A276086.
%Y A323878 Cf. also A323068, A323069, A323879.
%K A323878 nonn,base
%O A323878 1,6
%A A323878 _Antti Karttunen_, Feb 07 2019