%I #40 Aug 31 2023 08:15:59
%S 0,0,1,0,0,0,0,0,0,0,1,2,0,3,4,5,8,6,11,8,13,12,14,12,15,15,16,16,17,
%T 15,18,18,20,19,23,19,28,22,29,30,35,31,36,34,39,36,41,38,47,40,48,48,
%U 50,48,51,50,54,50,55,55,56,56,56,59,56,60,61,63,62,64
%N a(n) is the length of the initial transient, before the periodic part, on the n-th diagonal from the left of rule-30 1-D cellular automaton, when started from a single ON cell.
%H Paolo Xausa, <a href="/A363346/b363346.txt">Table of n, a(n) for n = 1..1000</a>
%H Michael Brunnbauer, <a href="https://brunni.de/findings30/">Diagonals in elementary cellular automaton 30</a>, 2019 (<a href="/A363346/a363346.pdf">local PDF copy</a>, with author's permission).
%H Eric S. Rowland, <a href="https://wpmedia.wolfram.com/uploads/sites/13/2018/02/16-3-4.pdf">Local Nested Structure in Rule 30</a>, Complex Systems 16 (2006), pp. 239-258.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule30.html">Rule 30</a>.
%H Stephen Wolfram, <a href="https://www.wolframscience.com/nks/notes-2-1--rule-30/">Notes on Chapter 2, Rule 30</a>, from A New Kind of Science Online, Wolfram Media, 2002.
%H Stephen Wolfram, <a href="https://writings.stephenwolfram.com/2019/10/announcing-the-rule-30-prizes/">Announcing the Rule 30 Prizes</a>, Stephen Wolfram Writings, 2019.
%H Paolo Xausa, <a href="/A363346/a363346_1.png">First 1000 evolution steps</a>, with transient cells in blue shades.
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%e In the following diagram, showing the first 22 evolution steps of the CA, three diagonals are highlighted, along with their transient and periodic parts (the rest of the CA is represented by hyphens, for better visualization).
%e .
%e 3rd diagonal
%e __ Transient = 1
%e - / Repeat = 0
%e --1 a(3) = 1
%e --0--
%e --0---- 12th diagonal
%e --0------ __ Transient = 01
%e --0--------/ Repeat = 0010
%e --0--------0- a(12) = 2
%e --0--------1---
%e --0--------0----- __ 20th diagonal
%e --0--------0-------/ Transient = 01000101
%e --0--------1-------0- Repeat = 1100
%e --0--------0-------1--- a(20) = 8
%e --0--------0-------0-----
%e --0--------0-------0-------
%e --0--------1-------0---------
%e --0--------0-------1-----------
%e --0--------0-------0-------------
%e --0--------0-------1---------------
%e --0--------1-------1-----------------
%e --0--------0-------1-------------------
%e --0--------0-------0---------------------
%e --0--------0-------0-----------------------
%e --0--------1-------1-------------------------
%e .
%e In the following diagram the transient cells on every diagonal are represented by asterisks. This results in the division of the CA into two regions: ordered behavior on the left, and apparently chaotic behavior on the right. The boundary between the two regions moves to the left, on average, by about 0.252 cells every evolution step (see Wolfram, 2002 and 2019).
%e .
%e -
%e --*
%e -----
%e -------
%e ---------
%e ----------*
%e -----------*-
%e -----------*-**
%e -------------****
%e -------------******
%e --------------*******
%e ---------------********
%e Order ---------------********** Disorder
%e ----------------***********
%e ----------------*************
%e ----------------*-*************
%e ------------------***************
%e ------------------*****************
%e ------------------*-*****************
%e ------------------*-*******************
%e --------------------*********************
%e --------------------***********************
%e --------------------*************************
%e .
%t A363346list[nmax_]:=With[{ca=CellularAutomaton[86,{{1},0},{2nmax,{1-nmax,nmax}}]},Array[Length[First[FindTransientRepeat[Drop[Diagonal[ca,nmax-#],Ceiling[(#-1)/2]],2]]]&,nmax]];A363346list[100]
%o (Python) # See Brunnbauer link, Appendix 3.
%Y Cf. A070950, A094605 (periods of diagonals from the right).
%Y Cf. A363344 (diagonals), A363345 (eventual periods), A364241.
%K nonn
%O 1,12
%A _Paolo Xausa_, May 28 2023