

A338292


Lexicographically earliest sequence of positive integers such that for any distinct m and n, (a(m+1a(m)), ..., a(m)) <> (a(n+1a(n)), ..., a(n)).


2



1, 2, 2, 3, 2, 3, 3, 3, 4, 2, 3, 4, 3, 3, 4, 4, 3, 4, 4, 4, 4, 5, 2, 3, 4, 4, 5, 3, 3, 4, 5, 4, 3, 4, 5, 5, 3, 4, 4, 5, 4, 4, 4, 5, 5, 4, 4, 5, 5, 5, 4, 5, 4, 5, 5, 5, 5, 5, 6, 2, 3, 4, 5, 5, 5, 6, 3, 3, 4, 5, 5, 6, 4, 3, 4, 5, 6, 4, 4, 4, 5, 6, 5, 3, 4, 5, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

In other words, for any n > 0, the tuple comprising the a(n) terms up to and including a(n) is always unique.
This sequence is unbounded.
The number 1 appears once.
The number 2 appears after the first occurrence of a number.


LINKS



EXAMPLE

The first terms, alongside the corresponding tuples, are:
n a(n) (a(n+1a(n)), ..., a(n))
  
1 1 (1)
2 2 (1, 2)
3 2 (2, 2)
4 3 (2, 2, 3)
5 2 (3, 2)
6 3 (3, 2, 3)
7 3 (2, 3, 3)
8 3 (3, 3, 3)
9 4 (3, 3, 3, 4)
10 2 (4, 2)
11 3 (4, 2, 3)
12 4 (4, 2, 3, 4)
13 3 (3, 4, 3)
14 3 (4, 3, 3)
15 4 (4, 3, 3, 4)
16 4 (3, 3, 4, 4)


PROG

(PARI) See Links section.


CROSSREFS

See A338283 for a similar sequence.


KEYWORD

nonn


AUTHOR



STATUS

approved



