OFFSET
0,16
COMMENTS
For n > 0, a(n) is the number of prime factors p of n such that the primorial base representation of n (A049345) has a nonzero digit under that same radix p, which is equal to the number of prime factors of n that divide A276086(n) [or vice versa], i.e., number of prime factors shared by n and A276806(n).
LINKS
FORMULA
EXAMPLE
a(0) = 0 as A049345(0) = 0 does not contain any nonzero digits.
a(1) = 0 as A049345(1) = 1, so the corresponding radix prime is 2, and 2 does not divide 1.
a(15) = 2 as A049345(15) = 211, with the corresponding radix primes 2, 3 and 5, of which 3 and 5 divide 6.
a(140) = 2 as A049345(140) = 4310, with nonzero digits having radix primes 3, 5, 7, of which the two latter divide 140 = 2^2 * 5 * 7.
PROG
(PARI) A392608(n) = { my(p=2, s=0, orgn=n); while(n, s += ((n%p) && !(orgn%p)); n = n\p; p = nextprime(1+p)); (s); };
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Antti Karttunen, Jan 24 2026
STATUS
approved
