A323878 Number of divisors d of n such that A276086(d) divides n.

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, 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, 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

Offset: 1

Author

Antti Karttunen, Feb 07 2019

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 1..30030
• Index entries for sequences related to primorial base

Crossrefs

Cf. A276086.

Cf. also A323068, A323069, A323879.

Programs

PARI

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; };
A323878(n) = sumdiv(n,d,!(n%A276086(d)));

Formula

a(n) = Sum_{d|n} [A276086(d)|n], where [ ] is the Iverson bracket.