

A319018


Number of ON cells after n generations of twodimensional automaton based on knight moves (see Comments for definition).


9



0, 1, 9, 17, 57, 65, 121, 145, 265, 273, 329, 377, 617, 657, 865, 921, 1201, 1209, 1265, 1313, 1553, 1617, 2001, 2121, 2689, 2745, 3009, 3153, 3841, 3953, 4513, 4649, 5297, 5305, 5361, 5409, 5649, 5713, 6097, 6233, 6881, 6953, 7353, 7585, 8713, 8913, 9961
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

The cells are the squares of the standard square grid.
Cells are either OFF or ON, once they are ON they stay ON forever.
Each cell has 8 neighbors, the cells that are a knight's move away.
We begin in generation 1 with a single ON cell.
A cell is turned ON at generation n+1 if it has exactly one ON neighbor at generation n.
(Since cells stay ON, an equivalent definition is that a cell is turned ON at generation n+1 if it has exactly one neighbor that has been turned ON at some earlier generation.  N. J. A. Sloane, Dec 19 2018)
This sequence has similarities with A151725: here we use knight moves, there we use king moves.
This is a knight'smove version of the UlamWarburton cellular automaton (see A147562).  N. J. A. Sloane, Dec 21 2018
The structure has dihedral D_8 symmetry (quarterturn rotations plus reflections, which generate the dihedral group D_8 of order 8), so A319019 is a multiple of 8 (compare A322050).  N. J. A. Sloane, Dec 16 2018
From Omar E. Pol, Dec 16 2018: (Start)
For n >> 1 (for example: n = 257) the structure of this sequence is similar to the structure of both A194270 and of A220500, the Dtoothpick cellular automata of the second kind and of the third kind respectively. The animations of both CAs are in the Applegate's movie version.
Also, the graph of A319018 is a bit similar to the graph of A245540, which is essentially a 45degree3Dwedge of A245542 (a pyramid) which is the partial sums of A160239 (Fredkin's replicator). See "Plot 2": A319018 vs. A245540. (End)
The conjecture that A322050(2^k+1)=1 also suggests a fractal geometry. Let P_k be the associated set of eight points. It appears that P_k may be written as the intersection of four fixed lines, y = +2*x and x = +2*y, with a circle, x^2 + y^2 = 5*4^k (see linked image "LogPeriodic Coloring").  Bradley Klee, Dec 16 2018
In many of these toothpick or cellular automata sequences it is common to see graphs which look like some version of the famous blancmange curve (also known as the Takagi curve). I expect that is what we are seeing when we look at the graph of A322049, although we probably need to go a lot further out before the true shape becomes apparent.  N. J. A. Sloane, Dec 17 2018
The graph of A322049 (related to first differences of this sequence) appears to have rather a selfsimilar structure which repeats at powers of 2, and more specifically at 2^10 = 1024. There is no central symmetry or continuity, which are characteristic properties of the blancmange curve.  M. F. Hasler, Dec 28 2018
The 8 points added in generation n = 2^k + 1 are P_k = 2^k*K where K = {(+2, +1), (+1, +2)} is the set of the initial 8 knight moves. So P_k is indeed the intersection of the rays of slope +1/2 resp. +2 and a circle of radius 2^k*sqrt(5). In the subsequent generation n = 2^k + 2, the new cells switched on are exactly the 7 "new" knight move neighbors of these 8 cells, (P_k + K) \ (2^k  1)*K. The 8th neighbor, lying one knight move closer to the origin, has been switched on in generation 2^k, together with an octagonal "wall" consisting in every other cell on horizontal and vertical segments between these points (2^k  1)*K, and all cells on the diagonal segments between these points, as well as 2 more diagonals just next to these (on the inner side) and shorter by 2 cells (so they are empty for k = 1). This yields 4*(2 + (2^k  2)*(1+3)) new ON cells in generation 2^k, plus 8*(2^(k1)  2) more new ON cells on horizontal, vertical and diagonal lines 4 units closer to the origin for k > 2, and similar additional terms for k > 4 etc.  M. F. Hasler, Dec 28 2018


LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..2049
David Applegate, The movie version.
Nathan Epstein, Gfycat animation of sequence.
M. F. Hasler, Interactive illustration of A319018 and A319019, Dec. 2018.
Bradley Klee, LogPeriodic Coloring at stage 257.
Bradley Klee, Logperiodic coloring of the first quadrant, over the chair tiling.
Rémy Sigrist, Illustration of the structure at stage 7
Rémy Sigrist, Illustration of the structure at stage 257
Rémy Sigrist, Colored illustration of the structure at stage 257 (where the hue is a function of the stage)
Rémy Sigrist, PARI program for A319018
N. J. A. Sloane, Handdrawn sketch showing terms through about the eighth shell, but using offset a(0)=1. Illustrates the octagonal "castle walls".
N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, Part I, Part 2, Slides. (Mentions this sequence)
Index entries for sequences related to cellular automata
Index entries for sequences related to toothpick sequences


FORMULA

No formula or recurrence is presently known. See A322049 for a promising attack.  N. J. A. Sloane, Dec 16 2018
a(n) = Sum_{k=1..n} A319019(n) = 1 + 8*Sum_{k=2..n} A322050(n) for n >= 1. In particular, a(n)  1 is divisible by 8 for all n >= 1.  M. F. Hasler, Dec 28 2018


PROG

(PARI) A319018(n)=sum(i=1, n, A319019[i]) \\ with array A319019=A319019_upto(N) precomputed with sufficiently large N.  M. F. Hasler, Dec 28 2018


CROSSREFS

Cf. A151725, A319019 (first differences).
For further analysis see A322048, A322049, A322050, A322051.
See A322055, A322056 for a variation.
See also A139250, A147562, A194270, A220500.
Sequence in context: A146576 A147138 A282764 * A101304 A146601 A121955
Adjacent sequences: A319015 A319016 A319017 * A319019 A319020 A319021


KEYWORD

nonn


AUTHOR

Rémy Sigrist, Sep 08 2018


EXTENSIONS

Deleted an incorrect illustration.  N. J. A. Sloane, Dec 17 2018


STATUS

approved



