A347696 -id:A347696 - cp's OEIS frontend

Showing 1-1 of 1 results.

A347697 a(n) = max_{k <= n} A347696(k).

Original entry on oeis.org

0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11

Offset: 0

N. J. A. Sloane, Oct 11 2021

nonn

The n-th run of consecutive equal terms appears to have length A137688(n). - Rémy Sigrist, Oct 11 2021

Rémy Sigrist, Table of n, a(n) for n = 0..8191
Ravi Vakil, On the Steenrod length of real projective spaces: finding longest chains in certain directed graphs, Discrete Mathematics 204 (1999) 415-425.
Rémy Sigrist, C program for A347697

Cf. A137688, A347696.

C
```
See Links section.
```

More terms from Rémy Sigrist, Oct 11 2021

Showing 1-1 of 1 results.