Rule 190 is one of the elementary cellular automaton rules described by Wolfram (1983, 2002). It specifies the next color
in a cell, depending on its color and its immediate neighbors. Its rule outcomes
are encoded in the binary representation 
. This rule is illustrated above together with
the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 56).
The mirror image, complement, and mirror complement are rules 246, 130, and 144, respectively.
Starting with a single black cell on an otherwise white infinite row, successive generations 
,
1, ... are given by interpreting the numbers 1, 7, 29, 119, 477, 1911, 7645, 30583,
... (OEIS A037576, starting at index 1) in
binary, namely 1, 111, 11101, 1110111, 111011101, ...
(OEIS A118111). The 
th term is given by the first 
digits of the quaternary
digit sequence 131313..., or, more explicitly, by
 |  |  |
(1)
|
 |  | ![1/(15)[-10-3(-1)^n+7·4^(n+1)]](/images/equations/Rule190/Inline10.svg) |
(2)
|
(E. W. Weisstein, Apr. 13, 2006). Rule 190 is therefore computationally reducible for an initial configuration consisting of a single black cell. It has generating function
 |
(3)
|
