VOOZH about

URL: https://oeis.org/A378385

⇱ A378385 - OEIS

login
A378385
a(n) is the length of the largest finite maximal run of consecutive integers missing from the set {A377091(k), k = 0..n}, or 0 if no such run exists.
1
0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 3, 2, 1, 0, 0, 0, 0, 0, 4, 3, 2, 1, 0, 0, 0, 0, 0, 0, 0, 4, 3, 2, 1, 0, 0, 0, 0, 0, 0, 0, 6, 3, 3, 3, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 7, 3, 3, 3, 3, 2, 1, 0, 0, 0, 0, 0, 0
OFFSET
0,14
LINKS
Rémy Sigrist, PARI program
FORMULA
a(n) <= A380263(n).
EXAMPLE
The initial terms are:
n a(n) A377091(n) Maximal run
-- ---- ---------- ------------
0 0 0 None
1 0 1 None
2 0 2 None
3 1 -2 -1
4 0 -1 None
5 0 3 None
6 0 4 None
7 0 5 None
8 1 -4 -3
9 0 -3 None
10 0 6 None
11 0 7 None
12 0 8 None
13 3 -8 -7..-5
14 2 -7 -6..-5
15 1 -6 -5
PROG
(PARI) \\ See Links section.
CROSSREFS
Sequence in context: A321518 A267883 A333437 * A380263 A058257 A330959
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Feb 05 2025
STATUS
approved