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 A036743 #24 Aug 18 2025 06:27:57 %S A036743 38,37,36,35,39,34,33,32,31,30,28,27,26,25,29,24,23,22,21,20,18,17,16, %T A036743 15,48,47,46,45,49,44,43,42,41,40,19,14,13,12,11,98,97,96,95,99,94,93, %U A036743 92,91,90,10,8,7,6,5,1038,1037,1036,1035,1039,1034,1033,1032 %N A036743 Numbers <= 3999 sorted in Roman numeral reverse lexicographic order. %H A036743 Nathaniel Johnston, <a href="/A036743/b036743.txt">Table of n, a(n) for n = 1..3999</a> (full sequence) %p A036743 A036743 := sort([seq(convert(n,roman), n=1..3999)], not lexorder): seq(convert(A036743[n], arabic), n=1..62); # _Nathaniel Johnston_, May 18 2011 %t A036743 FromRomanNumeral[ReverseSort[RomanNumeral[Range[3999]]]] (* _Paolo Xausa_, Aug 18 2025 *) %o A036743 (Python) %o A036743 def A036743(n): return A36742[3999-n] # See A036742. - _M. F. Hasler_, Aug 16 2025 %Y A036743 Cf. A036742. %K A036743 easy,fini,full,nonn %O A036743 1,1 %A A036743 _David W. Wilson_