OFFSET
1,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..500
F. Ruskey, C.R. Miers, and J. Sawada, The number of irreducible polynomials and Lyndon words with given trace, SIAM J. Discrete Math. 14 (2001), 240-245.
FORMULA
a(n) = (1/(16*n)) * Sum_{odd d divides n} mu(d)*16^(n/d), where mu is the Möbius function A008683.
MATHEMATICA
a[n_] := DivisorSum[n, MoebiusMu[#] * 16^(n/#) &, OddQ[#] &] / (16*n); Array[a, 21] (* Amiram Eldar, Oct 04 2023 *)
PROG
(PARI) a(n) = sumdiv(n, d, if (d%2, moebius(d)*16^(n/d)))/(16*n); \\ Michel Marcus, Mar 11 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 11 2018
STATUS
approved