

A134963


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


2



2, 11, 51, 860, 28156, 1093273, 110321561, 21929490122, 6858741615699, 4400789480783375, 5530201631127973447, 12721104195050291553064, 75225548540139768335134985, 4080967796136376032811105207453
(list;
graph;
refs;
listen;
history;
text;
internal format)



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



