The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by Kausthub Gudipati (See also Kausthub Gudipati's wiki page)

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A198516

Largest lifetime of any configuration starting from n cells which are bishop-connected for the cell automaton defined in A198514.
(history; published version)

#3 by Kausthub Gudipati at Wed Oct 26 00:52:39 EDT 2011

STATUS

editing

proposed

#2 by Kausthub Gudipati at Wed Oct 26 00:49:34 EDT 2011

NAME

allocated for Kausthub GudipatiConfiguration starting from n cells which are bishop connected with the longest lifetimes with cell automaton according to A198515.

DATA

1, 2, 3, 6, 6, 8, 9, 10, 14, 17, 17, 20

OFFSET

1,2

LINKS

Erich Friedman, <a href="http://www2.stetson.edu/~efriedma/mathmagic/0902.html">Problem of the month September 2002</a>

KEYWORD

allocated

nonn,more

AUTHOR

Kausthub Gudipati (shivakausthub(AT)yahoo.com), Oct 26 2011

STATUS

approved

editing

#1 by Kausthub Gudipati at Wed Oct 26 00:49:34 EDT 2011

NAME

allocated for Kausthub Gudipati

KEYWORD

allocated

STATUS

approved

A198515

Largest lifetime of any configuration starting from n cells which are king-wise connected for the cell automaton defined in A198514.
(history; published version)

#3 by Kausthub Gudipati at Wed Oct 26 00:43:43 EDT 2011

STATUS

editing

proposed

#2 by Kausthub Gudipati at Wed Oct 26 00:43:29 EDT 2011

NAME

allocated for Kausthub GudipatiConfiguration starting from n cells which are king connected with the largest lifetime with cell automaton according to A198514.

DATA

1, 3, 11, 16, 22, 31, 30, 35, 39, 43

OFFSET

1,2

LINKS

Erich Friedman, <a href="http://www2.stetson.edu/~efriedma/mathmagic/0902.html">Problem of the month September 2002</a>

EXAMPLE

Solution for n=2

33

3123

3213

33

KEYWORD

allocated

nonn,more

AUTHOR

Kausthub Gudipati (shivakausthub(AT)yahoo.com), Oct 26 2011

STATUS

approved

editing

#1 by Kausthub Gudipati at Wed Oct 26 00:43:29 EDT 2011

NAME

allocated for Kausthub Gudipati

KEYWORD

allocated

STATUS

approved

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.
(history; published version)

#3 by Kausthub Gudipati at Wed Oct 26 00:36:48 EDT 2011

STATUS

editing

proposed

Discussion

Wed Oct 26

12:42

T. D. Noe: IMHO, you should work on your own sequences. If Erich Friedman thinks these are worthy of submitting to OEIS, he can do it.

21:26

D. S. McNeil: From our experience with Problem of the Month sequences in the past I think we should require a code before accepting them.

#2 by Kausthub Gudipati at Wed Oct 26 00:36:39 EDT 2011

NAME

allocated for Kausthub GudipatiConsider a cellular automaton 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 n, if cell is in state 0 and the sum of the states of its neighborhood switches to n, the cell switches to state n. At any time n, if no cell switches to cell n, the growth stops. The sequence gives the configuration starting from n cells which are rook connected with the largest lifetimes.

DATA

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

OFFSET

1,2

LINKS

Erich Friedman, <a href="http://www2.stetson.edu/~efriedma/mathmagic/0902.html">Problem of the month September 2002</a>

EXAMPLE

The solution for n=4

9 9

85 4 58

32 23

6311136

313

74 47

8

KEYWORD

allocated

nonn,more

AUTHOR

Kausthub Gudipati (shivakausthub(AT)yahoo.com), Oct 26 2011

STATUS

approved

editing

#1 by Kausthub Gudipati at Wed Oct 26 00:36:39 EDT 2011

NAME

allocated for Kausthub Gudipati

KEYWORD

allocated

STATUS

approved

A197880

Squarefree part of ((2n-1)!)^(2n-3).
(history; published version)

#6 by Kausthub Gudipati at Tue Oct 25 11:00:19 EDT 2011

STATUS

editing

proposed

Discussion

Tue Oct 25

11:18

D. S. McNeil: Withdrawn by author.