|
Search: id:A134963
|
|
|
| A134963 |
|
Number of configurations in Conway's game of "Life" that fit into an n X n square and vanish in one step. |
|
+0
3
|
|
| 2, 11, 51, 860, 28156, 1093273, 110321561, 21929490122, 6858741615699, 4400789480783375, 5530201631127973447
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
These counts have not been reduced to take account of the symmetries of the board.
|
|
REFERENCES
|
E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982; see Chapter 25.
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
|
|
EXAMPLE
|
For example, a(2)=11 because the 2 X 2 configurations remain nonempty if and only if they have more than two live cells; 1+4+6=11.
|
|
CROSSREFS
|
Cf. A136278, A136279, A136280.
Adjacent sequences: A134960 A134961 A134962 this_sequence A134964 A134965 A134966
Sequence in context: A119366 A034574 A054665 this_sequence A026956 A026986 A026996
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
D. E. Knuth, Feb 03 2008. a(11) sent Mar 26 2008.
|
|
|
Search completed in 0.002 seconds
|
