A194125 n such that a length-n CLHCA of maximal period exists.

2, 3, 4, 5, 6, 7, 9, 10, 11, 15, 17, 18, 20, 21, 22, 23, 25, 28, 29, 31, 33, 35, 36, 39, 41, 47, 49, 52, 55, 57, 58, 60, 63, 65, 68, 71, 73, 79, 81, 84, 87, 89, 93, 94, 95, 97, 98, 100, 103, 105, 106, 108, 111, 113, 118, 119, 121, 123, 124, 127, 129, 130, 132, 134, 135, 137, 142, 145, 148, 150, 151, 153, 159, 161, 167, 169, 170, 172, 174, 175, 177, 178, 183, 185, 191, 193, 194, 198, 199, 201

Offset: 1

Author

Joerg Arndt, Aug 15 2011

Keywords

• nonn

Comments

A CLHCA is a cyclic linear hybrid cellular automaton (defined on p.883 of the Fxtbook, see link below). For fixed n its period depends only on the weight of its rule vector. The polynomial corresponding to a weight-w length-n CLHCA is x^n+(1+x)^w (or its reciprocal polynomial 1+x^w*(1+x)^(n-w)).

Sequence starts as A073726 (and appears to be a subset), first terms missing in this one are 140, 212, 236 (and no more <= 400).

Links

• Joerg Arndt, Matters Computational (The Fxtbook), section 41.9.1, pp. 883-885
• Joerg Arndt, Rules for CLHCA with maximal period up to degree 400, Complete list of primitive trinomials over GF(2) up to degree 400.
• Joerg Arndt, Complete list of primitive trinomials over GF(2) up to degree 400 [Cached copy, with permission]

Crossrefs

Cf. A073726 (n such that a primitive trinomial over GF(2) exists).