login
A365460
Number of distinct primorials in the greedy sum of primorials adding to A181821(n).
2
1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 4, 1, 2, 2, 3, 1, 2, 2, 2, 2, 3, 2, 4, 1, 3, 3, 2, 1, 5, 3, 3, 1, 3, 2, 3, 2, 2, 3, 5, 1, 3, 2, 3, 2, 5, 2, 2, 1, 3, 4, 5, 2, 5, 4, 3, 1, 3, 2, 6, 2, 4, 2, 6, 1, 6, 4, 3, 3, 4, 3, 6, 1, 3, 3, 7, 2, 4, 4, 4, 2, 8, 2, 4, 3, 4, 4, 4, 1, 6, 3, 3, 2, 6, 3, 7, 2, 3
OFFSET
1,5
FORMULA
a(n) = A267263(A181821(n)).
a(n) = A329040(A122111(n)).
a(n) <= A365461(n).
PROG
(PARI)
A181821(n) = { my(f=factor(n), p=0, m=1); forstep(i=#f~, 1, -1, while(f[i, 2], f[i, 2]--; m *= (p=nextprime(p+1))^primepi(f[i, 1]))); (m); };
A267263(n) = { my(s=0, p=2, d); while(n, d = (n%p); s += !!d; n = (n-d)/p; p = nextprime(1+p)); (s); };
CROSSREFS
Cf. also A365461.
Sequence in context: A338652 A033109 A321469 * A235644 A298475 A175096
KEYWORD
nonn
AUTHOR
Antti Karttunen, Sep 15 2023
STATUS
approved