close
login
A392140
Number of prime factors of 1+2^2+3^3+...+n^n (counted with multiplicity).
1
0, 1, 5, 7, 1, 1, 6, 6, 4, 1, 5, 5, 2, 7, 8, 7, 7, 5, 10, 8, 5, 4, 5, 6, 3, 3, 8, 6, 3, 1, 7, 6, 5, 5, 12, 14, 3, 3, 5, 7, 5, 5, 16, 5, 5, 7, 7, 5, 7, 7, 9, 9, 9, 7, 5, 4, 6, 6, 7, 8, 5, 5, 8, 12, 5, 3, 7, 15, 4, 7, 12, 10, 3, 4, 9, 6, 6, 5, 6, 9, 8, 2, 10, 7, 8, 8, 8, 7, 3, 7, 10, 8, 3, 8, 4
OFFSET
1,3
COMMENTS
Are odd terms more frequent than even terms?
FORMULA
a(n) = bigomega(1+2^2+...+n^n) = A001222(A001923(n)).
EXAMPLE
a(4) = bigomega(1+2^2+3^3+4^4) = bigomega(288)=7, since 288=2*2*2*2*2*3*3.
PROG
(Python)
from sympy import primeomega
def A392140(n): return primeomega(sum(i**i for i in range(1, n+1)))
print([A392140(n) for n in range(1, 31)])
(PARI) a(n) = bigomega(sum(i=1, n, i^i)); \\ Michel Marcus, Jan 01 2026
CROSSREFS
Sequence in context: A329346 A258716 A195300 * A019697 A217173 A246952
KEYWORD
nonn,hard
AUTHOR
Alex Ratushnyak, Jan 01 2026
EXTENSIONS
a(49)-a(95) from Michael S. Branicky, Jan 09 2026 using factordb.net
STATUS
approved