|
|
A160420
|
|
Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton whose skeleton is the same network as the toothpick structure of A139250 but with toothpicks of length 4.
|
|
10
|
|
|
0, 5, 13, 27, 41, 57, 85, 123, 149, 165, 193, 233, 277, 337, 429, 527, 577, 593, 621, 661, 705, 765, 857, 957, 1025, 1085, 1181, 1305, 1453, 1665, 1945, 2187, 2285, 2301, 2329, 2369, 2413, 2473, 2565, 2665, 2733, 2793, 2889, 3013, 3161, 3373, 3653, 3897, 4013
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is also the number of grid points that are covered after n-th stage by an polyedge as the toothpick structure of A139250, but with toothpicks of length 4.
|
|
LINKS
|
|
|
FORMULA
|
The above conjecture is true: each toothpick covers exactly two more grid points than the corresponding toothpick in A147614.
|
|
EXAMPLE
|
a(2)=13:
.o-o-o-o-o
.....|....
.....o....
.....|....
.....o....
.....|....
.....o....
.....|....
.o-o-o-o-o
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|