Rule 250 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 (OEIS A071028;
Wolfram 2002, p. 56).
For an initial condition of a single black cell on an otherwise white infinite row, this rule produces the same full configurations as rules 50,
58, 114, 122, 178, 186, and 242. Rule 250 and these seven rules are precisely those
with binary representation .
Rule 250 is a generalized additiveelementary cellular automaton under
the operation OR() (Wolfram 2002, p. 952),
where is the value of the neighboring
cell to the left and
is the value of the neighboring cell to the right.
. This rule is illustrated above together with
the evolution of a single black cell it produces after 15 steps (OEIS A071028;
Wolfram 2002, p. 56).
.
) (Wolfram 2002, p. 952),
where 
is the value of the neighboring
cell to the left and 
is the value of the neighboring cell to the right.
