A323879 Number of divisors d of n such that A276154(d) divides n.

0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 4, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 5, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 5, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 2, 0, 4, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 2, 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. A002110, A276154.

Cf. also A323878.

Programs

PARI

A276151(n) = { my(s=1); forprime(p=2, , if(n%p, return(n-s), s *= p)); };
A276152(n) = { my(s=1); forprime(p=2, , if(n%p, return(s*p), s *= p)); };
A276154(n) = if(!n,n,(A276152(n) + A276154(A276151(n))));
A323879(n) = sumdiv(n,d,!(n%A276154(d)));

Formula

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