|
| |
|
|
A374324
|
|
The maximal exponent in the prime factorization of the numbers whose maximal exponent in their prime factorization is even.
|
|
5
|
|
|
|
0, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 6, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 8, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
|
|
|
FORMULA
|
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} (2*k * (1/zeta(2*k+1) - 1/zeta(2*k))) / Sum_{k>=2} (-1)^k * (1 - 1/zeta(k)) = 2.48584683692026915946... .
|
|
|
MATHEMATICA
|
f[n_] := Module[{e = If[n == 1, 0, Max[FactorInteger[n][[;; , 2]]]]}, If[EvenQ[e], e, Nothing]]; Array[f, 350]
|
|
|
PROG
|
(PARI) lista(kmax) = {my(e); print1(0, ", "); for(k = 2, kmax, e = vecmax(factor(k)[, 2]); if(!(e % 2), print1(e, ", "))); }
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
