This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A194125 #11 Nov 28 2016 11:29:49 %S A194125 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, %T A194125 47,49,52,55,57,58,60,63,65,68,71,73,79,81,84,87,89,93,94,95,97,98, %U A194125 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 %N A194125 n such that a length-n CLHCA of maximal period exists. %C A194125 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)). %C A194125 Sequence starts as A073726 (and appears to be a subset), first terms missing in this one are 140, 212, 236 (and no more <= 400). %H A194125 Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 41.9.1, pp. 883-885 %H A194125 Joerg Arndt, <a href="http://www.jjj.de/mathdata/clhca-rules.txt">Rules for CLHCA with maximal period up to degree 400</a>, <a href="http://www.jjj.de/mathdata/all-trinomial-primpoly.txt">Complete list of primitive trinomials over GF(2) up to degree 400</a>. %H A194125 Joerg Arndt, <a href="/A001153/a001153.txt">Complete list of primitive trinomials over GF(2) up to degree 400</a> [Cached copy, with permission] %Y A194125 Cf. A073726 (n such that a primitive trinomial over GF(2) exists). %K A194125 nonn %O A194125 1,1 %A A194125 _Joerg Arndt_, Aug 15 2011