

A334956


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


2



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, 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, 3, 2, 3, 2, 3, 1, 3, 2, 3, 0, 3, 2, 2, 2, 3, 3, 3, 1, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,6


COMMENTS

This sequence is a variant of A334944.
Will every finite sequence of nonnegative integers appear?


LINKS

Table of n, a(n) for n=1..87.
Rémy Sigrist, Colored scatterplot of the ordinal transform of the first 1000000 terms
Rémy Sigrist, Perl program for A334956


EXAMPLE

For n = 1:
 for w = 1: (0) did not appear,
 so a(1) = 0.
For n = 2:
 for w = 1: (0) appeared,
 for w = 2: (0, 1) did not appear,
 so a(2) = 1.
For n = 3:
 for w = 1: (0) appeared,
 for w = 2: (1, 1) did not appear,
 so a(3) = 1.


PROG

(Perl) See Links section.


CROSSREFS

Cf. A334944.
Sequence in context: A055378 A217921 A272328 * A335881 A239703 A029338
Adjacent sequences: A334953 A334954 A334955 * A334957 A334958 A334959


KEYWORD

nonn


AUTHOR

Rémy Sigrist, May 17 2020


STATUS

approved



