A334944 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A334944

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 least such e.

0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 1, 1, 0, 1, 2, 1, 0, 2, 1, 1, 1, 2, 0, 1, 0, 1, 0, 2, 2, 0, 2, 0, 1, 1, 1, 0, 0, 1, 2, 2, 1, 2, 0, 0, 1, 3, 0, 0, 0, 3, 1, 0, 0, 2, 1, 0, 0, 3, 0, 1, 0, 3, 2, 0, 0, 2, 2, 2, 0, 0, 3, 2, 1, 0, 1, 1, 2, 1, 1, 0, 2, 0, 2, 1, 2, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,7

COMMENTS

This sequence is an unbounded variant of A334941.

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 A334944

EXAMPLE

For n = 1: