|
|
A100008
|
|
Number of unitary divisors of 2n.
|
|
4
|
|
|
2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 8, 2, 4, 4, 4, 4, 8, 4, 4, 4, 4, 4, 4, 4, 4, 8, 4, 2, 8, 4, 8, 4, 4, 4, 8, 4, 4, 8, 4, 4, 8, 4, 4, 4, 4, 4, 8, 4, 4, 4, 8, 4, 8, 4, 4, 8, 4, 4, 8, 2, 8, 8, 4, 4, 8, 8, 4, 4, 4, 4, 8, 4, 8, 8, 4, 4, 4, 4, 4, 8, 8, 4, 8, 4, 4, 8, 8, 4, 8, 4, 8, 4, 4, 4, 8, 4, 4, 8, 4, 4, 16
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
b(n) = a(n)/a(1) is multiplicative with b(2^e) = 1, b(p^e) = 2 otherwise. - David W. Wilson, Jun 12 2005
|
|
LINKS
|
|
|
FORMULA
|
Dirichlet g.f.: 2*zeta(s)^2/(zeta(2*s)*(1+1/2^s)). - Amiram Eldar, Jan 28 2023
Sum_{k=1..n} a(k) ~ 8*n*((log(n) - 1 + 2*gamma + log(2)/3)/Pi^2 - 12*zeta'(2)/Pi^4), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Jan 28 2023
|
|
EXAMPLE
|
a(6)=4 because among the six divisors of 12 only 1,3,4 and 12 are unitary.
|
|
MAPLE
|
with(numtheory): for n from 1 to 120 do printf(`%d, `, 2^nops(ifactors(2*n)[2])) od: # Emeric Deutsch, Dec 24 2004
|
|
MATHEMATICA
|
a[n_] := 2^PrimeNu[2*n]; Array[a, 100] (* Amiram Eldar, Jan 28 2023 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|