A330267 Lexicographically earliest sequence of nonnegative terms such that for any n > 0 and k > 0, a(n+2*k) <> max(a(n), a(n+k)).

0, 0, 1, 0, 0, 1, 2, 3, 4, 0, 0, 1, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 10, 11, 0, 0, 1, 0, 0, 1, 12, 13, 4, 0, 0, 1, 0, 0, 1, 6, 5, 4, 7, 8, 9, 14, 15, 6, 16, 10, 5, 17, 11, 10, 7, 8, 3, 2, 5, 2, 3, 18, 19, 20, 21, 3, 2, 12, 2, 3, 13, 22, 2, 11, 2, 10, 23

Offset

1,7

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, Scatterplot of the first 250000 terms

Rémy Sigrist, C program for A330267

Formula

a(n) = 0 iff n belongs to A003278.

Prog

(C) See Links section.

Crossrefs

Cf. A003278 (positions of 0's).

See A229037, A268811, A276204, A309890, A317805, A361933, A364057 for similar sequences.

See A330622, A330623 and A330629 for other variants.

Sequence in context: A037847 A037883 A350775 * A023868 A122275 A197024

Adjacent sequences: A330264 A330265 A330266 * A330268 A330269 A330270

Keyword

nonn

Author

Rémy Sigrist, Dec 21 2019

Status

approved