login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049477 For each record-breaking row, m, of A088643, the sequence gives the length, k, of the longest earlier row contained in row m. 4

%I #13 Aug 03 2021 18:32:16

%S 1,1,1,7,2,4,34,1,47,47,47,47,47,47,47,153,212,212,212,212,212,212,

%T 212,334,334,785,785,720,785,785,785,785,785,1144,1144,1144,1167,2105,

%U 2105,2105,2105,2105,2105,2105,2105,2105,2105,2105,2105,2105

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

%C A record-breaking row, m, of A088643, is a row where m-k sets a record.

%C a(n) = A049476(n) - A049478(n).

%Y Cf. A088643, A049476, A049478, A346778.

%K nonn,nice

%O 1,4

%A _N. J. A. Sloane_

%E Entry revised by Editors of OEIS, Aug 03 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:41 EDT 2024. Contains 371967 sequences. (Running on oeis4.)