|
%I #29 Jan 27 2022 08:01:45
%S 1,2,3,1,3,2,3,1,2,3,2,1,3,1,2,1,3,2,3,1,2,3,2,1,2,3,1,2,1,3,2,3,1,3,
%T 2,1,3,1,2,3,2,1,2,3,1,3,2,1,3,1,2,1,3,2,3,1,2,3,2,1,2,3,1,2,1,3,2,3,
%U 1,3,2,1,2,3,1,2,1,3,1,2,3,1,3,2,1,2,3,2,1,3,2,3,1,2,1,3,1,2,3,2,1,3,2,3,1
%N Arshon's sequence: start from 1 and replace the letters in odd positions using 1 -> 123, 2 -> 231, 3 -> 312 and the letters in even positions using 1 -> 321, 2-> 132, 3 -> 213.
%C The first three iterations give 1; 123; 123132312; ... the limiting sequence is shown here. Properties: the sequence is squarefree and cannot be defined by iteration of a morphism.
%C a(n) = A219762(n+1) + 1. - _Reinhard Zumkeller_, Aug 08 2014
%D G. A. Gurevich, Nonrepeating sequences, pp. 61-66 of Kvant Selecta: Combinatorics I, ed. S. Tabachnikov, AMS, 2001.
%H Reinhard Zumkeller, <a href="/A099054/b099054.txt">Table of n, a(n) for n = 0..10000</a>
%H S. E. Arshon, <a href="http://mi.mathnet.ru/mp409">A proof of the existence of infinite asymmetric sequences on n symbols</a>. Matematicheskoe Prosveshchenie (Mathematical Education), 2 (1935) 24-33 (in Russian).
%H S. E. Arshon, <a href="http://mi.mathnet.ru/msb5627"> A proof of the existence of infinite asymmetric sequences on n symbols</a>. Mat. Sb., 2 (1937) 769-779 (in Russian, with French abstract).
%H James D. Currie: <a href="https://doi.org/10.1016/S0012-365X(02)00372-2">No iterated morphism generates any Arshon Sequence of Odd Order</a>, Discrete Math. 259 (2002), no. 1-3, 277-283.
%H Sergey Kitaev, There are no iterated morphisms that define the Arshon sequence and the σ-sequence, Journal of Automata, Languages and Combinatorics 8 (2003) 1, 43-0-50. <a href="http://personal.strath.ac.uk/sergey.kitaev/Papers/Arshon.pdf">preprint</a>, <a href="https://arxiv.org/abs/math/0205216">arXiv:math/0205216</a> [math.CO], 2002.
%H Zheng-Pan Wang, <a href="https://doi.org/10.1142/S0219498812502106">Some combinatorial properties of Arshon sequences of arbitrary orders</a>, J. Algebra and Applications, 12 (2013), article #1250210.
%t f[n_List] := Block[{a = {}, l = Length[n], k = 1}, While[k < l + 1, If[ EvenQ[ k], Switch[ n[[k]], 1, AppendTo[a, 321], 2, AppendTo[a, 132], 3, AppendTo[a, 213]], Switch[ n[[k]], 1, AppendTo[a, 123], 2, AppendTo[a, 231], 3, AppendTo[a, 312]]]; k++ ]; Flatten[IntegerDigits /@ a]]; Take[ Nest[f, {1}, 5], 105] (* _Robert G. Wilson v_, Nov 15 2004 *)
%o (Haskell)
%o import Data.List (transpose, stripPrefix); import Data.Maybe (fromJust)
%o a099054 n = a099054_list !! n
%o a099054_list = 1 : concatMap fromJust (zipWith stripPrefix ass $ tail ass)
%o where ass = iterate f [1]
%o f xs = concat $ concat $ transpose [map g $ e xs, map h $ o xs]
%o g 1 = [1,2,3]; g 2 = [2,3,1]; g 3 = [3,1,2]
%o h 1 = [3,2,1]; h 2 = [1,3,2]; h 3 = [2,1,3]
%o e [] = []; e [x] = [x]; e (x:_:xs) = x : e xs
%o o [] = []; o [x] = []; o (_:x:xs) = x : o xs
%o -- _Reinhard Zumkeller_, Aug 08 2014
%Y Cf. A100336, A100337, A003270.
%Y Cf. A219762, A241418 (first differences).
%K nonn,nice,easy
%O 0,2
%A _Sergey Kitaev_, Nov 14 2004
%E More terms from _Robert G. Wilson v_ and _John W. Layman_, Nov 15 2004
|
