(* _Peter J. C. Moses, _, Sep 03 2013 *)
(* _Peter J. C. Moses, _, Sep 03 2013 *)
reviewed
approved
proposed
reviewed
editing
proposed
proposed
editing
editing
proposed
1
1 2
1 2 1
1 2 1 3
1 2 1 3 1
1 2 1 3 1 2
1 2 1 3 1 2 1
1 2 1 3 1 2 1 4
1 2 1 3 1 2 1 4 1
1 2 1 3 1 2 1 4 1 2
Map[IntegerExponent[2*#, 2] &, Range[Range[33]]] (* A225743 array, by formula *)
allocated for Clark KimberlingTriangular array: row n is least squarefree word of length n using positive integers.
1, 1, 2, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 4, 1, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 4
1,3
Squarefree means that the word contains no consecutive identical subwords.
Clark Kimberling, <a href="/A225743/b225743.txt">Table of n, a(n) for n = 1..10000</a>
The first 10 rows are shown here:
1
1 2
1 2 1
1 2 1 3
1 2 1 3 1
1 2 1 3 1 2
1 2 1 3 1 2 1
1 2 1 3 1 2 1 4
1 2 1 3 1 2 1 4 1
1 2 1 3 1 2 1 4 1 2
1 contains no square; 11 contains a square but 12 does not; 121 contains no square; both 1211 and 1212 have squares but 1213 does not.
Cf. A001511 (the limiting sequence)
allocated
nonn,tabl,easy
Clark Kimberling, Sep 03 2013
approved
editing
allocated for Clark Kimberling
recycled
allocated
editing
approved