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.

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, Table of n, a(n) for n = 0..10000

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

Cf. A377091, A380263.

Sequence in context: A321518 A267883 A333437 * A380263 A058257 A330959

Adjacent sequences: A378382 A378383 A378384 * A378386 A378387 A378388

Keyword

nonn

Author

Rémy Sigrist, Feb 05 2025

Status

approved