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.
%I A201882 #16 Feb 17 2025 01:31:55 %S A201882 1,3,8,11,27,36,84,231,349,535,1267,2916,4114,14349,27045,35059,89723, %T A201882 234443,408129,799350,1926026,2170589,4291892,10758318,21141201, %U A201882 57927399,122141530,138265841 %N A201882 Where the first run of length n occurs in maximally unpredictable sequences A007061, A038219. %C A201882 A201881(a(n)) = n and A201881(m) < n for m < a(n). %C A201882 Since every substring appears in A007061 (and A038219) this sequence is infinite. - _N. J. A. Sloane_, May 17 2019 %H A201882 Rémy Sigrist, <a href="/A201882/a201882.txt">C program</a> %o A201882 (Haskell) %o A201882 a201882 = ((+ 1) . fromJust . (`elemIndex` a201881_list)) %o A201882 (C) // See Links section %Y A201882 Cf. A007061, A038219. %K A201882 nonn,more %O A201882 1,2 %A A201882 _Reinhard Zumkeller_, Dec 11 2011 %E A201882 a(11)-a(28) from _Rémy Sigrist_, Jul 31 2022