login
A328831
Number of distinct prime factors p such that p^p is a divisor of n-th number > 0 that is a sum of distinct primorial numbers, A276156(n).
3
0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0
OFFSET
1,20
FORMULA
a(n) = A129251(A276156(n)).
PROG
(PARI)
A129251(n) = { my(f = factor(n)); sum(k=1, #f~, (f[k, 2]>=f[k, 1])); };
A276156(n) = { my(p=2, pr=1, s=0); while(n, if(n%2, s += pr); n >>= 1; pr *= p; p = nextprime(1+p)); (s); };
CROSSREFS
Cf. A328832 (gives A276156(k) for those k for which a(k) = 0).
Sequence in context: A086076 A334348 A316717 * A085981 A243224 A127324
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 30 2019
STATUS
approved