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

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,5

Comments

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

Links

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

Prog

(C) See Links section.

Crossrefs

Cf. A137688, A347696.

Sequence in context: A197637 A235492 A226762 * A300763 A359276 A002265

Adjacent sequences: A347694 A347695 A347696 * A347698 A347699 A347700

Keyword

nonn

Author

N. J. A. Sloane, Oct 11 2021

Extensions

More terms from Rémy Sigrist, Oct 11 2021

Status

approved