%I #7 May 19 2020 19:15:35

%S 0,1,1,0,0,2,1,2,0,2,2,2,1,1,2,2,0,1,2,1,0,2,0,0,1,0,1,3,1,2,3,0,2,3,

%T 2,2,3,1,1,1,3,2,1,3,0,1,3,3,2,0,3,2,3,3,1,0,3,1,3,3,0,0,0,3,0,3,3,3,

%U 3,2,3,2,3,1,3,2,3,0,3,2,2,2,3,3,3,1,3

%N For any n > 0, let w be the least positive number such that the values (a(n+1-w), ..., a(n-1), e) do not appear continuously in (a(1), ..., a(n-1)) for some e in 0..w-1; a(n) is the greatest such e.

%C This sequence is a variant of A334944.

%C Will every finite sequence of nonnegative integers appear?

%H Rémy Sigrist, <a href="/A334956/a334956.png">Colored scatterplot of the ordinal transform of the first 1000000 terms</a>

%H Rémy Sigrist, <a href="/A334956/a334956.pl.txt">Perl program for A334956</a>

%e For n = 1:

%e - for w = 1: (0) did not appear,

%e - so a(1) = 0.

%e For n = 2:

%e - for w = 1: (0) appeared,

%e - for w = 2: (0, 1) did not appear,

%e - so a(2) = 1.

%e For n = 3:

%e - for w = 1: (0) appeared,

%e - for w = 2: (1, 1) did not appear,

%e - so a(3) = 1.

%o (Perl) See Links section.

%Y Cf. A334944.

%K nonn

%O 1,6

%A _Rémy Sigrist_, May 17 2020