|
| |
|
|
A334956
|
|
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.
|
|
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
|
|
|
|
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
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
