A161645 First differences of A161644: number of new ON cells at generation n of the triangular cellular automaton described in A161644.
0, 1, 3, 6, 6, 6, 12, 18, 12, 6, 12, 24, 30, 24, 30, 42, 24, 6, 12, 24, 30, 30, 42, 66, 66, 36, 30, 60, 84, 72, 78, 96, 48, 6, 12, 24, 30, 30, 42, 66, 66, 42, 42, 78, 114, 114, 114, 150, 138, 60, 30, 60, 84, 90, 114, 174, 198, 132, 90, 144, 210, 192, 192, 210, 96, 6, 12, 24
Offset: 0
Examples
From _Omar E. Pol_, Apr 08 2015: (Start) The positive terms written as an irregular triangle in which the row lengths are the terms of A011782: 1; 3; 6,6; 6,12,18,12; 6,12,24,30,24,30,42,24; 6,12,24,30,30,42,66,66,36,30,60,84,72,78,96,48; 6,12,24,30,30,42,66,66,42,42,78,114,114,114,150,138,60,30,60,84,90,114,174,198,132,90,144,210,192,192,210,96; ... It appears that the right border gives A003945. (End)
References
- R. Reed, The Lemming Simulation Problem, Mathematics in School, 3 (#6, Nov. 1974), front cover and pp. 5-6. [Describes the dual structure where new triangles are joined at vertices rather than edges.]
Links
- Rémy Sigrist, Table of n, a(n) for n = 0..10000
- David Applegate, The movie version
- David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
- R. Reed, The Lemming Simulation Problem, Mathematics in School, 3 (#6, Nov. 1974), front cover and pp. 5-6. [Scanned photocopy of pages 5, 6 only, with annotations by R. K. Guy and N. J. A. Sloane]
- N. J. A. Sloane, Illustration of first 7 generations of A161644 and A295560 (edge-to-edge version)
- N. J. A. Sloane, Illustration of first 11 generations of A161644 and A295560 (vertex-to-vertex version) [Include the 6 cells marked x to get A161644(11), exclude them to get A295560(11).]
- N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Comments