login
A366493
Lexicographically earliest sequence such that each subsequence enclosed by two equal terms is distinct.
7
1, 1, 2, 1, 2, 2, 1, 3, 1, 2, 3, 1, 2, 4, 1, 2, 3, 2, 1, 3, 2, 1, 4, 1, 2, 3, 3, 1, 2, 4, 2, 1, 3, 4, 1, 2, 3, 4, 1, 2, 4, 3, 1, 2, 4, 3, 2, 1, 4, 2, 1, 3, 5, 1, 2, 3, 4, 2, 1, 3, 5, 2, 1, 3, 4, 2, 1, 4, 3, 1, 2, 5, 1, 2, 3, 4, 3, 1, 2, 5, 2, 1, 3, 4, 4, 1, 2, 3, 5, 1, 2, 4, 3, 4, 1, 2, 5, 3, 1, 2, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 5
OFFSET
1,3
COMMENTS
A new value is always followed by 1.
LINKS
Samuel Harkness, MATLAB program
EXAMPLE
a(2)=1 because the subsequence (1,1) has not occurred before.
a(8)=3 because every smaller number would form a subsequence that has occurred already. a(8) cannot be 1 because this would make the subsequence (1,1), which was seen before at i=1,2. a(8) cannot be 2 because then we would have the subsequence (2,1,2) for a second time (first at i=3-5): 1,1,2,1,2,2,1,2
PROG
(MATLAB) See Links section.
CROSSREFS
Cf. A330896.
Sequence in context: A095686 A105258 A329173 * A352998 A339351 A284322
KEYWORD
nonn,easy
AUTHOR
Neal Gersh Tolunsky, Oct 10 2023
STATUS
approved