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 A026180 #9 Aug 26 2021 06:03:16 %S A026180 1,4,10,12,16,22,28,30,34,36,40,46,48,52,58,64,66,70,76,82,84,88,90, %T A026180 94,100,102,106,108,112,118,120,124,130,136,138,142,144,148,154,156, %U A026180 160,166,172,174,178,184,190,192,196,198,202,208 %N A026180 a(n) = s(k), where k is the n-th number such that s(j)<s(k) for all j<k, where s = A026177. %H A026180 F. M. Dekking, <a href="https://arxiv.org/abs/2001.08915">Permutations of N generated by left-right filling algorithms</a>, arXiv:2001.08915 [math.CO], 2020, see R_orec in section 2.3. %Y A026180 Cf. A026177. %K A026180 nonn %O A026180 1,2 %A A026180 _Clark Kimberling_