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.

A200742 Greatest number such that in table A200741 the first terms in row n coincide with row n+1.

This page as a plain text file.
%I A200742 #8 Jul 13 2013 12:04:19
%S A200742 1,2,4,10,7,35,33,36,31,82,17,81,78,170,55,132,28,195,247,313,439,325,
%T A200742 415,498,376,213,161,693,608,948,739,557,831,1007,1252,631,1156,1370,
%U A200742 148,579,1023,1755,1677,1239,1638,1839,2281,2401,1963,2630,2521,2951
%N A200742 Greatest number such that in table A200741 the first terms in row n coincide with row n+1.
%C A200742 Shorter rows in A200741 are contained in longer rows; a(n) gives length of common initial segments of consecutive rows: A200741(n,k) = A200741(n+1,k) for k <= a(n).
%H A200742 Reinhard Zumkeller, <a href="/A200742/b200742.txt">Table of n, a(n) for n = 1..100</a>
%o A200742 (Haskell)
%o A200742 a200742 n = a200742_list !! (n-1)
%o A200742 a200742_list = f a200741_tabl where
%o A200742    f (rs:rss'@(rs':rss)) =
%o A200742      (length $ takeWhile (== EQ) $ zipWith compare rs rs') : f rss'
%Y A200742 Cf. A200738.
%K A200742 nonn
%O A200742 1,2
%A A200742 _Reinhard Zumkeller_, Nov 21 2011