|
%I #14 Mar 07 2022 06:31:11
%S 1,2,1,2,1,2,3,1,2,1,3,1,2,3,4,1,2,3,1,4,2,1,3,1,2,3,4,5,1,2,3,4,1,5,
%T 2,3,1,4,5,2,1,3,1,2,3,4,5,6,1,2,3,4,5,1,6,2,3,4,1,5,6,2,3,1,4,5,6,2,
%U 1,3
%N Irregular triangle read by rows where row n is Newey's sequence containing all permutations of 1..n.
%C Row n contains n^2 - 2*n + 4 = A117950(n-1) terms, numbered as columns k >= 1. Row n contains within it all permutations of 1..n as subsequences. These subsequences need not be consecutive terms (and in general are not).
%C Newey's construction (section 6) is an initial 1..n then successive term 1 and n-2 terms from a rotating block of 2..n. The effect is term 1 at k=1, k=n+1, then steps n-1 apart, and the rest filled with repeating 2..n.
%C Koutas and Hu (equation (1)) form the same by blocks D_k(m|n) which start with 1 and then appropriate parts of rotated 2..n like Newey.
%C _Jon E. Schoenfield_ in A062714 starts from repeated 2..n and inserts 1's.
%C For n = 3 to 7, Newey shows these sequences are as short as possible (A062714) for any sequence containing all permutations, and noted the "obvious" conjecture that maybe they would be shortest always. But this is not so, since _Jon E. Schoenfield_ gives a shorter n=16 in A062714, and Radomirovic constructs shorter for all n >= 10.
%H Kevin Ryde, <a href="/A351468/b351468.txt">Table of n, a(n) for rows 2 .. 30, flattened</a>
%H P. J. Koutas and T. C. Hu, <a href="http://doi.org/10.1016/0012-365X(75)90004-7">Shortest String Containing All Permutations</a>, Discrete Mathematics, volume 11, 1975, pages 125-132.
%H Malcolm Newey, <a href="http://i.stanford.edu/TR/CS-TR-73-340.html">Notes on a Problem Involving Permutations as Subsequences</a>, Stanford Artificial Intelligence Laboratory, Memo AIM-190, STAN-CS-73-340, 1973.
%F T(n,k) = k for 1 <= k <= n, otherwise.
%F T(n,k) = 1 if r=0 and q<n, otherwise.
%F T(n,k) = 2 + ((r-q) mod (n-1)),
%F where division q = floor((k-2)/(n-1)) remainder r = (k-2) mod (n-1). [Adapted from _Jon E. Schoenfield_ in A062714.]
%e Triangle begins
%e n=2: 1,2,1,2
%e n=3: 1,2,3,1,2,1,3
%e n=4: 1,2,3,4,1,2,3,1,4,2,1,3
%e n=5: 1,2,3,4,5,1,2,3,4,1,5,2,3,1,4,5,2,1,3
%e For row n=3, the permutations of 1,2,3 are located within the row as follows (some are present in multiple ways too).
%e 1,2,3,1,2,1,3 row n=3
%e 1-2-3 \
%e 1---3---2 | all permutations
%e 2-1-3 | of 1,2,3 within
%e 2-3-1 | row n=3
%e 3-1-2 |
%e 3---2-1 /
%e For row n=4, see example in A062714.
%e For row n=5, the pattern of 1's among repeating 2..5 is
%e 2,3,4,5, 2,3,4, 5,2,3, 4,5,2, 3
%e 1, 1, 1, 1, 1,
%e \-------/ \-----/ \-----/ \-----/
%e 5 apart, thereafter 4 apart
%o (PARI) T(n,k) = if(k<=n,k, my(q,r);[q,r]=divrem(k-2,n-1); if(r==0&&q<n,1, 2+(r-q)%(n-1)));
%o (PARI) row(n) = my(r=1,t=1); vector((n-1)^2+3,i, if(i==1,1, r++>n,r=1+(n>2);1, if(t++>n,t=2, t)));
%Y Cf. A117950 (row lengths), A062714 (shortest possible).
%Y Cf. A351469 (Adelman's sequences).
%K nonn,easy,tabf
%O 2,2
%A _Kevin Ryde_, Feb 23 2022
|
