|
| |
|
|
A126978
|
|
a(n) = 104n + 9977.
|
|
3
| |
|
|
9977, 10081, 10185, 10289, 10393, 10497, 10601, 10705, 10809, 10913, 11017, 11121, 11225, 11329, 11433, 11537, 11641, 11745, 11849, 11953, 12057, 12161, 12265, 12369, 12473, 12577, 12681, 12785, 12889, 12993, 13097, 13201, 13305, 13409, 13513, 13617
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Langton's Ant Superhighway, the start point (9977th iteration, J. Propp) and the period length for the Superhighway (104).
|
|
|
REFERENCES
| C. Langton, "Studying Artificial Life with Cellular Automata," Physica D, vol. 22, pp. 120-149, 1986.
James Propp, "Further Ant-ics," Mathematical Intelligencer, 16 pp. 37-42, 1994.
P. Sakar, "A Brief History of Cellular Automata," ACM Computing Surveys, vol. 32, 2000.
|
|
|
LINKS
| B. D. Swan, Table of n, a(n) for n=0,...,10000
Ed Pegg Jr, 2D Turing Machines .
S. Wolfram, 2D Turing Machines .
|
|
|
FORMULA
| a(0)=9977, a(1)=10081, a(n)=2*a(n-1)-a(n-2) [From Harvey P. Dale, Dec 16 2011]
|
|
|
MATHEMATICA
| 104*Range[0, 40]+9977 (* or *) LinearRecurrence[{2, -1}, {9977, 10081}, 40] (* From Harvey P. Dale, Dec 16 2011 *)
|
|
|
CROSSREFS
| Cf. A102127, A102358, A102369, A126979, A126980.
Sequence in context: A031856 A031858 A182696 * A188790 A190832 A043528
Adjacent sequences: A126975 A126976 A126977 * A126979 A126980 A126981
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| R. H. Barbour (bbarbour(AT)unitec.ac.nz), Mar 20 2007, Jun 12 2007
|
| |
|
|
