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 A371864 #9 Apr 10 2024 09:17:35 %S A371864 0,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,30,38,59,62,137,141,144,192, %T A371864 201,208,213,230,242,305,315,391,413,433,435,452,468,473,625,697,780, %U A371864 794,995,1124,1171,1224,2049,2275,2791,3179,3440,3672,3939,19447,19854,20014 %N A371864 Indices of records in A370748. %C A371864 A370748(a(88)) is the first occurrence of the highest possible term in A370748. %H A371864 Michael S. Branicky, <a href="/A371864/b371864.txt">Table of n, a(n) for n = 1..88</a> %o A371864 (Python) # uses imports, functions in A370748 %o A371864 def agen(): # generator of terms %o A371864 record = -1 %o A371864 for i, v in enumerate(A370748gen()): %o A371864 if v > record: %o A371864 idx, record = i, v %o A371864 yield idx %o A371864 print(list(islice(agen(), 56))) # _Michael S. Branicky_, Apr 09 2024 %Y A371864 Cf. A370748, A371863 (records). %K A371864 nonn,base,fini,full %O A371864 1,2 %A A371864 _Michael S. Branicky_, Apr 09 2024