OFFSET
1,1
COMMENTS
Number of monic irreducible polynomials of degree n over GF(16). - Robert Israel, Jan 07 2015
Number of Lyndon words (aperiodic necklaces) with n beads of 16 colors. - Andrew Howroyd, Dec 10 2017
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..825
Yash Puri and Thomas Ward, A dynamical property unique to the Lucas sequence, Fibonacci Quarterly, Volume 39, Number 5 (November 2001), pp. 398-402.
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
T. Ward, Exactly realizable sequences
FORMULA
a(n) = (1/n)* Sum_{d|n} mu(d)*16^(n/d).
G.f.: Sum_{k>=1} mu(k)*log(1/(1 - 16*x^k))/k. - Ilya Gutkovskiy, May 19 2019
EXAMPLE
a(2)=120 since there are 256 points of period 2 in the full 16-shift and 16 fixed points, so there must be (256-16)/2 = 120 orbits of length 2.
MAPLE
f:= (n, p) -> add(numtheory:-mobius(d)*p^(n/d), d=numtheory:-divisors(n))/n:
seq(f(n, 16), n=1..30); # Robert Israel, Jan 07 2015
MATHEMATICA
A060219[n_]:= DivisorSum[n, MoebiusMu[#]*16^(n/#) &]/n; Table[A060219[n], {n, 40}] (* G. C. Greubel, Aug 01 2024 *)
PROG
(PARI) a(n) = sumdiv(n, d, moebius(d)*16^(n/d))/n; \\ Michel Marcus, Jan 07 2015
(Magma)A060219:= func< n | (&+[MoebiusMu(d)*16^Floor(n/d): d in Divisors(n)])/n >;
[A060219(n): n in [1..40]]; // G. C. Greubel, Aug 01 2024
(SageMath)
def A060219(n): return sum(moebius(k)*16^(n//k) for k in (1..n) if (k).divides(n))/n
[A060219(n) for n in range(1, 41)] # G. C. Greubel, Aug 01 2024
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Thomas Ward, Mar 21 2001
EXTENSIONS
Terms a(17) onward added by G. C. Greubel, Aug 01 2024
STATUS
approved