cp's OEIS Frontend

A060216 Number of orbits of length n under the full 13-shift (whose periodic points are counted by A001022).

%I A060216 #31 Jan 05 2025 19:51:36
%S A060216 13,78,728,7098,74256,804076,8964072,101962770,1178277464,13785812040,
%T A060216 162923672184,1941506688940,23298085122480,281241165925044,
%U A060216 3412392867581152,41588538022965570
%N A060216 Number of orbits of length n under the full 13-shift (whose periodic points are counted by A001022).
%C A060216 Number of monic irreducible polynomials of degree n over GF(13). - _Robert Israel_, Jan 07 2015
%C A060216 Number of Lyndon words (aperiodic necklaces) with n beads of 13 colors. - _Andrew Howroyd_, Dec 10 2017
%H A060216 Indranil Ghosh, <a href="/A060216/b060216.txt">Table of n, a(n) for n = 1..100</a>
%H A060216 Yash Puri and Thomas Ward, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/39-5/puri.pdf">A dynamical property unique to the Lucas sequence</a>, Fibonacci Quarterly, Volume 39, Number 5 (November 2001), pp. 398-402.
%H A060216 Y. Puri and T. Ward, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL4/WARD/short.html">Arithmetic and growth of periodic orbits</a>, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
%H A060216 T. Ward, <a href="http://www.mth.uea.ac.uk/~h720/research/files/integersequences.html">Exactly realizable sequences</a>
%F A060216 a(n) = (1/n)* Sum_{d|n} mu(d) 13^(n/d).
%F A060216 G.f.: Sum_{k>=1} mu(k)*log(1/(1 - 13*x^k))/k. - _Ilya Gutkovskiy_, May 19 2019
%e A060216 a(2)=78 since there are 169 points of period 2 in the full 13-shift and 13 fixed points, so there must be (169-13)/2 = 78 orbits of length 2.
%p A060216 f:= n -> add(numtheory:-mobius(d)*13^(n/d),d=numtheory:-divisors(n))/n;
%p A060216 seq(f(n), n=1..100); # _Robert Israel_, Jan 07 2015
%t A060216 a[n_]:=(1/n) * Sum[MoebiusMu[d] *13^(n/d), {d, Divisors[n]}]; Table[a[n], {n, 20}] (* _Indranil Ghosh_, Mar 26 2017 *)
%o A060216 (PARI) a(n) = sumdiv(n, d, moebius(d)*13^(n/d))/n; \\ _Michel Marcus_, Jan 07 2015
%o A060216 (Python)
%o A060216 from sympy import divisors, mobius
%o A060216 print([sum(mobius(d) * 13**(n//d) for d in divisors(n))//n for n in range(1, 21)]) # _Indranil Ghosh_, Mar 26 2017
%Y A060216 Column 13 of A074650.
%Y A060216 Cf. A001022.
%K A060216 nonn
%O A060216 1,1
%A A060216 _Thomas Ward_, Mar 21 2001