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 A371863 #10 Apr 10 2024 09:17:20 %S A371863 1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,179308, %T A371863 589204,3162450,7653120,8469210,9481036,10543967,12869537,14527380, %U A371863 16927083,17940836,20865319,23874159,31527049,36594278,50189734,57624138,69871345,74136950,86021453 %N A371863 Records in A370748. %C A371863 a(88) is the highest possible term in A370748. %H A371863 Michael S. Branicky, <a href="/A371863/b371863.txt">Table of n, a(n) for n = 1..88</a> %o A371863 (Python) # uses imports, functions in A370748 %o A371863 def agen(): # generator of terms %o A371863 record = -1 %o A371863 for i, v in enumerate(A370748gen()): %o A371863 if v > record: %o A371863 idx, record = i, v %o A371863 yield record %o A371863 print(list(islice(agen(), 36))) # _Michael S. Branicky_, Apr 09 2024 %Y A371863 Cf. A370748, A371864 (indices of records). %K A371863 nonn,base,fini,full %O A371863 1,2 %A A371863 _Michael S. Branicky_, Apr 09 2024