

A001037


Number of degreen irreducible polynomials over GF(2); number of nbead necklaces with beads of 2 colors when turning over is not allowed and with primitive period n; number of binary Lyndon words of length n.
(Formerly M0116 N0046 N0287)


91



1, 2, 1, 2, 3, 6, 9, 18, 30, 56, 99, 186, 335, 630, 1161, 2182, 4080, 7710, 14532, 27594, 52377, 99858, 190557, 364722, 698870, 1342176, 2580795, 4971008, 9586395, 18512790, 35790267, 69273666, 134215680, 260300986, 505286415, 981706806, 1908866960, 3714566310, 7233615333, 14096302710, 27487764474
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Also dimensions of free Lie algebras  see A059966, which is essentially the same sequence.
This sequence also represents the number N of cycles of length L in a digraph under x^2 seen modulo a Mersenne prime M_q=2^q1. This number does not depend on q and L is any divisor of q1. See Theorem 5 and Corollary 3 of the Shallit and Vasiga paper: N=sum(eulerphi(d)/order(d,2)) where d is a divisor of 2^(q1)1 such that order(d,2)=L.  Tony Reix (Tony.Reix(AT)laposte.net), Nov 17 2005
Except for a(0) = 1, BauSen Du's [1985/2007] Table 1, p. 6, has this sequence as the 7th (rightmost) column. Other columns of the table include (but are not identified as) A006206A006208.  Jonathan Vos Post, Jun 18 2007
"Number of binary Lyndon words" means: number of binary strings inequivalent modulo rotation (cyclic permutation) of the digits and not having a period smaller than n. This provides a link to A103314, since these strings correspond to the inequivalent zerosum subsets of U_m (mth roots of unity) obtained by taking the union of U_n (nm) with 0 or more U_d (n  d, d  m) multiplied by some power of exp(i 2Pi/n) to make them mutually disjoint. (But not all zerosum subsets of U_m are of that form.)  M. F. Hasler, Jan 14 2007
Also the number of dynamical cycles of period n of a threshold Boolean automata network which is a quasiminimal positive circuit of size a multiple of n and which is updated in parallel.  Mathilde Noual (mathilde.noual(AT)enslyon.fr), Feb 25 2009
Also, the number of periodic points with (minimal) period n in the iteration of the tent map f(x):=2min{x,1x} on the unit interval.  Pietro Majer, Sep 22 2009
Number of distinct cycles of minimal period n in a shift dynamical system associated with a totally disconnected hyperbolic iterated function system (see Barnsley link).  Michel Marcus, Oct 06 2013
From JeanChristophe Hervé, Oct 26 2014: (Start)
For n > 0, a(n) is also the number of orbits of size n of the transform associated to the OldenburgerKolakoski sequence A000002 (and this is true for any map with 2^n periodic points of period n). The OldenburgerKolakoski transform changes a sequence of 1's and 2's by the sequence of the lengths of its runs. The OldenburgerKolakoski sequence is one of the two fixed points of this transform, the other being the same sequence without the initial term. A025142 and A025143 are the periodic points of the orbit of size 2. A027375(n) = n*a(n) gives the number of periodic points of minimal period n.
For n > 1, this sequence is equal to A059966 and to A060477, and for n = 1, a(1) = A059966(1)+1 = A060477(1)1; this because the nth term of all 3 sequences is equal to (1/n)*sum_{dn} mu(n/d)*(2^d+e), with e = 1/0/1 for resp. A059966/this sequence/A060477, and sum_{dn} mu(n/d) equals 1 for n = 1 and 0 for all n > 1. (End)
Warning: A000031 and A001037 are easily confused, since they have similar formulas.


REFERENCES

Michael F. Barnsley, Fractals Everywhere, Academic Press, San Diego, 1988, page 171 lemma 3.
E. R. Berlekamp, Algebraic Coding Theory, McGrawHill, NY, 1968, p. 84.
E. L. Blanton, Jr., S. P. Hurd and J. S. McCranie. On the digraph defined by squaring mod m, when m has primitive roots. Congr. Numer. 82 (1991), 167177.
P. J. Freyd and A. Scedrov, Categories, Allegories, NorthHolland, Amsterdam, 1990. See 1.925.
M. Lothaire, Combinatorics on Words, AddisonWesley, Reading, MA, 1983, pp. 65, 79.
Guy Melancon, Factorizing infinite words using Maple, MapleTech Journal, vol. 4, no. 1, 1997, pp. 3442, esp. p. 36.
M. R. Nester, (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence in entries N0046 and N0287).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

T. D. Noe, Table of n, a(n) for n = 0..200
Joerg Arndt, Matters Computational (The Fxtbook), pp.379383, pp.843845
E. L. Blanton, Jr., S. P. Hurd and J. S. McCranie, On a digraph defined by squaring modulo n, Fibonacci Quart. 30 (1992), 322333.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
R. Church, Tables of irreducible polynomials for the first four prime moduli, Annals Math., 36 (1935), 198209.
J. Demongeot, M. Noual and S. Sene, On the number of attractors of positive and negative threshold Boolean automata circuits, 2010 IEEE 24th Intl. Conf. Advan. Inf. Network. Appl. Workshops (WAINA), p 782789
BauSen Du, The Minimal Number of Periodic Orbits of Periods Guaranteed in Sharkovskii's Theorem. Bull. Austral. Math. Soc. 31(1985), 89103. Corrigendum: 32 (1985), 159.
S. V, Duzhin, D. V. Pasechnik, Groups acting on necklaces and sandpile groups, 2014. See page 85.  N. J. A. Sloane, Jun 30 2014
E. N. Gilbert and J. Riordan, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), 657665.
M. A. Harrison, On the classification of Boolean functions by the general linear and affine groups, J. Soc. Indust. Appl. Math. 12 (1964) 285299.
T. Laarhoven and B de Weger, The Collatz conjecture and De Bruijn graphs, arXiv preprint arXiv:1209.3495, 2012.  From N. J. A. Sloane, Dec 27 2012
J. C. Lagarias, The set of rational cycles for the 3x+1 problem, Acta Arithmetica, LVI (1990), pp. 3353.
R. J. Mathar, HardyLittlewood constants embedded into infinite products over all positive integers, sequence gamma_{2,j}^(T).
Ueli M. Maurer, Asymptoticallytight bounds on the number of cycles in generalized de BruijnGood graphs, Discrete applied mathematics 37 (1992): 421436. See Table 1.
H. Meyn and W. Götz, Selfreciprocal polynomials over finite fields
Mathilde Noual, Dynamics of Circuits and Intersecting Circuits, in Language and Automata Theory and Applications, Lecture Notes in Computer Science, 2012, Volume 7183/2012, 433444, ArXiv 1011.3930.  N. J. A. Sloane, Jul 07 2012
George Petrides and Johannes Mykkeltveit, On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes, in Sequences and Their Applications SETA 2006, Lecture Notes in Computer Science, Volume 4086/2006, pp 209222. [From N. J. A. Sloane, Jul 09 2009]
Y. Puri and T. Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
F. Ruskey, Necklaces, Lyndon words, De Bruijn sequences, etc.
F. Ruskey, Primitive and Irreducible Polynomials
Troy Vasiga and Jeffrey Shallit, On the iteration of certain quadratic maps over GF(p), Discrete Mathematics, Volume 277, Issues 13, 2004, pages 219240.
G. Viennot, Algèbres de Lie Libres et Monoïdes Libres, Lecture Notes in Mathematics 691, Springer Verlag 1978.
M. Waldschmidt, Lectures on Multiple Zeta Values, IMSC 2011.
Eric Weisstein's World of Mathematics, Irreducible Polynomial
Eric Weisstein's World of Mathematics, Lyndon Word
Wikipedia, Lyndon word
Index entries for sequences related to Lyndon words
Index entries for "core" sequences


FORMULA

a(n) = (1/n) sum_{ d divides n } mu(n/d) * 2^d.
A000031(n) = sum_{ d divides n } a(d).
2^n = sum_{ d divides n } d*a(d).
a(n) = A027375(n)/n.
a(n) = A000048(n) + A051841(n).
For n>1, a(n) = A059966(n) = A060477(n).
G.f.: 1  Sum_{n>=1} moebius(n)*log(1  2*x^n)/n, where moebius(n)=A008683(n).  Paul D. Hanna, Oct 13 2010


EXAMPLE

Binary strings (Lyndon words, cf. A102659):
a(0) = 1 = #{ "" },
a(1) = 2 = #{ "0", "1" },
a(2) = 1 = #{ "01" },
a(3) = 2 = #{ "001", "011" },
a(4) = 3 = #{ "0001", "0011", "0111" },
a(5) = 6 = #{ "00001", "00011", "00101", "00111", "01011", "01111" }.


MAPLE

with(numtheory): A001037 := proc(n) local a, d; if n = 0 then RETURN(1); else a := 0: for d in divisors(n) do a := a+mobius(n/d)*2^d; od: RETURN(a/n); fi; end;


MATHEMATICA

f[n_] := Block[{d = Divisors@ n}, Plus @@ (MoebiusMu[n/d]*2^d/n)]; Array[f, 32]


PROG

(PARI) a(n)=if(n<1, n==0, sumdiv(n, d, moebius(d)*2^(n/d))/n)
(PARI) {a(n)=polcoeff(1sum(k=1, n, moebius(k)/k*log(12*x^k+x*O(x^n))), n)} \\ Paul D. Hanna, Oct 13 2010
(PARI) a(n)=if(n>1, my(s); forstep(i=2^n+1, 2^(n+1), 2, s+=polisirreducible(Mod(1, 2) * Pol(binary(i)))); s, n+1) \\ Charles R Greathouse IV, Jan 26 2012
(Haskell)
a001037 0 = 1
a001037 n = (sum $ map (\d > (a000079 d) * a008683 (n `div` d)) $
a027750_row n) `div` n
 Reinhard Zumkeller, Feb 01 2013


CROSSREFS

Row sums of A051168, which gives the number of Lyndon words with fixed number of zeros and ones.
Euler transform is A000079.
See A058943 and A102569 for initial terms. See also A058947, A011260, A059966.
Irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): A058943, A058944, A058948, A058945, A058946. Primitive irreducible over GF(2), GF(3), GF(4), GF(5), GF(7): A058947, A058949, A058952, A058950, A058951.
Cf. A000031 (nbead necklaces but may have period dividing n), A014580, A046211, A046209, A006206A006208, A038063, A060477, A103314.
Cf. A027750, A008683.
See also A102659 for the list of binary Lyndon words themselves.
Sequence in context: A249050 A056493 A001371 * A122086 A082594 A051850
Adjacent sequences: A001034 A001035 A001036 * A001038 A001039 A001040


KEYWORD

nonn,core,easy,nice,changed


AUTHOR

N. J. A. Sloane


EXTENSIONS

Revised by N. J. A. Sloane, Jun 10 2012


STATUS

approved



