Help with Cellular Automata?

In one-dimensional cellular automata, each rule is a static eight-bit number that represents each three-cell combination that produces an "alive" state. In two-dimensional cellular automata, the rule can be a 512-bit number because the nine-cell neighborhood has 512 possible combinations, and each bit in the rule's number determines whether each combination produces an alive (1) or dead (0) state. Because of such complexity and the symmetry of the 2-D rules, the representation is simplified by stating how many cells in a neighborhood cause a cell to be born, to continue living, or to die. In the case of Conway's Game of Life, the rule is 3 neighbors must be alive in order for a cell to come to life, and an alive cell with 2 or 3 alive neighbors will remain alive in the next generation.
I want to find out the 512-bit number that represents this rule. Assuming the middle cell represents the one's place value in each 9-bit combination (it represents the two's place value in one-dimensional CA), what would the rule be? I can't find an online calculator that handles 512-bit numbers, but I believe I've found the formula for it.
3*Sigma(2^(2^a+2^b+2^c)) + Sigma(2^(1+2^d+2^e)),
With 1<=aAnd 1<=d
Multiplying the first half of the equation by 3 is the same as writing it as Sigma(2^(2^a+2^b+2^c) + 2^(1+2^a+2^b+2^c)), which covers three alive neighbors surrounding a cell, whether it is dead or alive. The second half of the equation covers an alive cell with exactly two alive neighbors.
Keep in mind, I've never been formally educated on sigma notation, so I don't know for certain if this covers any combinations I didn't intend or doesn't cover enough. If someone can tell me if it's the correct formula, I'd be very grateful.

View the original article here