A134963 Number of configurations in Conway's game of "Life" that fit into an n X n square and vanish in one step.

2, 11, 51, 860, 28156, 1093273, 110321561, 21929490122, 6858741615699, 4400789480783375, 5530201631127973447, 12721104195050291553064, 75225548540139768335134985, 4080967796136376032811105207453

Offset

1,1

Comments

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.

Links

Table of n, a(n) for n=1..14.

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.

Sequence in context: A119366 A034574 A054665 * A026956 A026986 A181290

Adjacent sequences: A134960 A134961 A134962 * A134964 A134965 A134966

Keyword

nonn,nice

Author

Don Knuth, Feb 03 2008

Extensions

a(11) from Don Knuth, Mar 26 2008

a(12)-a(15) from Tomas Rokicki, Oct 31 2010

Status

approved