cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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)).

This page as a plain text file.
%I A330267 #38 Nov 07 2023 20:41:42
%S A330267 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,
%T A330267 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,
%U A330267 3,18,19,20,21,3,2,12,2,3,13,22,2,11,2,10,23
%N 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)).
%H A330267 Rémy Sigrist, <a href="/A330267/b330267.txt">Table of n, a(n) for n = 1..10000</a>
%H A330267 Rémy Sigrist, <a href="/A330267/a330267.png">Scatterplot of the first 250000 terms</a>
%H A330267 Rémy Sigrist, <a href="/A330267/a330267.txt">C program for A330267</a>
%F A330267 a(n) = 0 iff n belongs to A003278.
%o A330267 (C) See Links section.
%Y A330267 Cf. A003278 (positions of 0's).
%Y A330267 See A229037, A268811, A276204, A309890, A317805, A361933, A364057 for similar sequences.
%Y A330267 See A330622, A330623 and A330629 for other variants.
%K A330267 nonn
%O A330267 1,7
%A A330267 _Rémy Sigrist_, Dec 21 2019