|
|
A335324
|
|
Square part of 4th-power-free part of n.
|
|
6
|
|
|
1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, 1, 1, 1, 1, 1, 9, 1, 4, 1, 1, 1, 4, 25, 1, 9, 4, 1, 1, 1, 1, 1, 1, 1, 36, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 1, 49, 25, 1, 4, 1, 9, 1, 4, 1, 1, 1, 4, 1, 1, 9, 4, 1, 1, 1, 4, 1, 1, 1, 36, 1, 1, 25, 4, 1, 1, 1, 1, 1, 1, 1, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Equivalently, biquadratefree (4th-power-free) part of square part of n.
Multiplicative. The terms are squares of squarefree numbers (A062503).
Every positive integer n is the product of a unique subset S_n of the terms of A050376 (sometimes called Fermi-Dirac primes). a(n) is the product of the members of S_n that are squares of prime numbers (A001248).
|
|
LINKS
|
|
|
FORMULA
|
a(p^e) = p^(2*floor(e/2) - 4*floor(e/4)). - Amiram Eldar, Jun 01 2020
Dirichlet g.f.: zeta(s) * zeta(2*s-2) * zeta(4*s)/(zeta(2*s) * zeta(4*s-4)).
Sum_{k=1..n} a(k) ~ (4*zeta(3/2)*zeta(4))/(21*zeta(3)) * n^(3/2). (End)
|
|
EXAMPLE
|
Removing the 4th powers from 192 = 2^6 * 3^1 gives 2^(6 - 4) * 3^1 = 2^2 * 3 = 12. So the 4th-power-free part of 192 is 12. The square part of 12 (largest square dividing 12) is 4. So a(192) = 4.
|
|
MATHEMATICA
|
f[p_, e_] := p^(2*Floor[e/2] - 4*Floor[e/4]); a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Jun 01 2020 *)
|
|
PROG
|
(PARI) A053165(n)=my(f=factor(n)); f[, 2]=f[, 2]%4; factorback(f);
|
|
CROSSREFS
|
The formula section details how the sequence maps the terms of A003961, A331590.
|
|
KEYWORD
|
nonn,easy,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|