Number of degree-n irreducible polynomials over GF(2); number of n-bead 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.
A001037
Number of degree-n irreducible polynomials over GF(2); number of n-bead 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.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =2a(4) =3a(5) =6a(6) =9a(7) =18a(8) =30a(9) =56a(10) =99a(11) =186a(12) =335a(13) =630a(14) =1161a(15) =2182a(16) =4080a(17) =7710a(18) =14532a(19) =27594a(20) =52377a(21) =99858a(22) =190557a(23) =364722a(24) =698870a(25) =1342176a(26) =2580795a(27) =4971008a(28) =9586395a(29) =18512790
External references
- oeis: A001037