Bitwise encoding of the state of a 1D cellular automaton after n steps from ...111000... where adjacent cells swap 01 <-> 10 when within triples 110 or 011.

A359303

Bitwise encoding of the state of a 1D cellular automaton after n steps from ...111000... where adjacent cells swap 01 <-> 10 when within triples 110 or 011.

Terms

    a(0) =1a(1) =3a(2) =5a(3) =11a(4) =13a(5) =39a(6) =43a(7) =45a(8) =103a(9) =155a(10) =171a(11) =173a(12) =359a(13) =411a(14) =619a(15) =669a(16) =1367a(17) =1371a(18) =1387a(19) =1437a(20) =3287a(21) =4923a(22) =5339a(23) =5467a(24) =5483a(25) =5533a(26) =11479a(27) =13115a(28) =19675a(29) =21339

External references