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.

A049477 For each record-breaking row, m, of A088643, the sequence gives the length, k, of the longest earlier row contained in row m.

Original entry on oeis.org

1, 1, 1, 7, 2, 4, 34, 1, 47, 47, 47, 47, 47, 47, 47, 153, 212, 212, 212, 212, 212, 212, 212, 334, 334, 785, 785, 720, 785, 785, 785, 785, 785, 1144, 1144, 1144, 1167, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105, 2105
Offset: 1

Views

Author

Keywords

Comments

A record-breaking row, m, of A088643, is a row where m-k sets a record.
a(n) = A049476(n) - A049478(n).

Crossrefs

Extensions

Entry revised by Editors of OEIS, Aug 03 2021