cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A198514 Consider a cellular automaton on the square grid where we start at time 1 with a finite collection of cells in state 1 and with all cells in state 0. At any time t, if a cell is in state 0 and the sum of the states of its neighborhood is t, the cell switches to state t. At any time t, if no cell switches to state t, the growth stops. The sequence gives the largest lifetime of any configuration starting from n cells which are rook connected.

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 11
6 22
7 22
8 23
9 29
10 29
11 35
12 36
13 36

List of values

[1, 3, 6, 9, 11, 22, 22, 23, 29, 29, 35, 36, 36]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.