OFFSET
1,1
COMMENTS
This sequence was important in designing the 2018 MIT Mystery Hunt puzzle "The Next Generation".
These are the rules that do not lose information entropy.
There is a symmetry: a(n) = 255 - a(163-n). [Corrected by Jinyuan Wang, Mar 08 2020]
LINKS
Jinyuan Wang, Table of n, a(n) for n = 1..162
MIT Mistery Hunt, The Next Generation, 2018.
EXAMPLE
Consider rule 1 that outputs a one if and only if there are three zeros above it. The rule cannot have 101 as a substring in the output.
MATHEMATICA
Select[Range[0, 255],
Length[Union[
Table[Take[
CellularAutomaton[#, IntegerDigits[n, 2, 5]], {2, 4}], {n, 0,
31}]]] == 8 &]
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Tanya Khovanova, Apr 08 2018
STATUS
approved