How do I find the rule number for a cellular automata rule?

Question

I have been given a rule for a cellular automata (in which so long as one adjacent cell is living but not both the next generation lives), but I can't find any reference works on cellular automata rule numbers.

Answer 1

Generate all three-bit numbers, of which there are 8. Each of those three bit numbers represents the three inputs to the automaton. The output of the automaton is a single bit. Interpret this sequence of output bits as a number.

For instance, rule 110 would indicate the binary number (note it is in LSB first) $0 1 1 1 0 1 1 0_2$ so we can say that $000_2\rightarrow0$, $001_2\rightarrow1$, etc.