|
|
A125072
|
|
a(n) = number of exponents in the prime-factorization of n which are triangular numbers.
|
|
3
|
|
|
0, 1, 1, 0, 1, 2, 1, 1, 0, 2, 1, 1, 1, 2, 2, 0, 1, 1, 1, 1, 2, 2, 1, 2, 0, 2, 1, 1, 1, 3, 1, 0, 2, 2, 2, 0, 1, 2, 2, 2, 1, 3, 1, 1, 1, 2, 1, 1, 0, 1, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 0, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 0, 1, 3, 1, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
Sum_{k=1..n} a(k) ~ n * (log(log(n)) + B + C), where B is Mertens's constant (A077761) and C = -P(2) + Sum_{k>=2} (P(k*(k+1)/2) - P(k*(k+1)/2 + 1)) = -0.34517646457715166126..., where P(s) is the prime zeta function. - Amiram Eldar, Sep 28 2023
|
|
EXAMPLE
|
The prime-factorization of 360 is 2^3 *3^2 *5^1. There are two exponents in this factorization which are triangular numbers, 1 and 3. So a(360) = 2.
|
|
MATHEMATICA
|
f[n_] := Length @ Select[Last /@ FactorInteger[n], IntegerQ[Sqrt[8# + 1]] &]; Table[f[n], {n, 110}] (* Ray Chandler, Nov 19 2006 *)
|
|
PROG
|
(PARI)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|