cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A102358 Finite sequence of iterations at which Langton's Ant passes through the origin.

Original entry on oeis.org

0, 4, 8, 16, 52, 60, 96, 140, 184, 276, 368, 376, 384, 392, 428, 436, 472, 656, 660, 3412, 4144, 4152, 6168, 6764, 8048, 8052, 8056, 8060, 8068
Offset: 1

Views

Author

Robert H Barbour, Feb 21 2005, corrected Feb 27 2005

Keywords

Comments

Ant Farm algorithm available from bbarbour(AT)unitec.ac.nz.
Numbers n such that A274369(n) = A274370(n) = 0. - Felix Fröhlich, Jul 26 2016

References

  • Christopher G. Langton et al., (1990) Artificial Life II. Addison-Wesley, Reading, MA., USA

Crossrefs

A102369 Intervals between successive arrivals of Langton's Ant at the origin.

Original entry on oeis.org

4, 4, 8, 36, 8, 36, 44, 44, 92, 92, 8, 8, 8, 8, 36, 8, 36, 184, 4, 2752, 732, 8, 2016, 596, 1284, 4, 4, 4, 8
Offset: 0

Views

Author

Robert H Barbour, Feb 22 2005, corrected Feb 27 2005

Keywords

Comments

Ant Farm algorithm available from Robert H Barbour.
First differences of A102358. - Felix Fröhlich, Jul 26 2016

References

  • Christopher G. Langton et al., (1990) Artificial Life II. Addison-Wesley, Reading, MA., USA

Crossrefs

A126978 a(n) = 104*n + 9977.

Original entry on oeis.org

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, 13721, 13825
Offset: 0

Views

Author

Robert H Barbour, Mar 20 2007, Jun 12 2007

Keywords

Comments

Langton's Ant Superhighway, the start point (9977th iteration, J. Propp) and the period length for the Superhighway (104).

Crossrefs

Programs

Formula

a(0)=9977, a(1)=10081, a(n) = 2*a(n-1) - a(n-2). - Harvey P. Dale, Dec 16 2011
G.f.: (9977 - 9873*x)/(1-x)^2. - Vincenzo Librandi, Sep 10 2015
E.g.f.: exp(x)*(9977 + 104*x). - Elmo R. Oliveira, Dec 08 2024

A094867 Number of iterations of the LQTL cellular automaton required to generate a square of cells in identical states.

Original entry on oeis.org

4, 8, 32, 64, 416, 832
Offset: 0

Views

Author

Robert H Barbour and J. Chapman, Jun 15 2004

Keywords

Comments

For the definition of the LQTL CA, see A102127. The square of size 1 on iteration 1 is not included.

Examples

			After step a(5) = 832 of the cellular automaton, the nonempty cells form a 8x8 square, all cells in state 2.
		

Crossrefs

Extensions

Edited by Andrey Zabolotskiy, Nov 05 2023

A102110 Iterations during which LQTL cellular automaton passes through the origin.

Original entry on oeis.org

4, 8, 12, 28, 32, 36, 40, 56, 60, 64, 68, 72, 76, 116, 120, 136, 140, 144, 148, 152, 164, 168, 172, 180, 184, 224, 228, 232, 236, 240, 244, 332, 336, 376, 380, 384, 388, 392, 396, 412, 416, 420, 424, 440, 444, 448, 452, 456, 460, 500, 504, 592, 596, 600, 604
Offset: 1

Views

Author

Robert H Barbour, Feb 14 2005

Keywords

Crossrefs

Cumulative sums of A102127.

Extensions

Terms a(19) and beyond from Andrey Zabolotskiy, Jan 06 2023
Showing 1-5 of 5 results.