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