%I #29 May 07 2019 15:14:29
%S 100,200,300,301,302,303,304,309,350,351,352,353,354,359,355,356,357,
%T 358,360,361,362,363,364,369,365,366,367,368,370,371,372,373,374,379,
%U 375,376,377,378,380,381,382,383,384,389,385,386,387,388,305,306,307
%N Numbers <= 3999 sorted in Roman numeral lexicographic order.
%C Beyond 3999 the numerals are not representable in ASCII and hence sorting becomes problematic. - Steven N. Severinghaus, Nov 17 2007
%H Steven N. Severinghaus, <a href="/A036742/b036742.txt">Table of n, a(n) for n = 1..3999</a>
%p A036742 := sort([seq(convert(n, roman), n=1..3999)], lexorder): seq(convert(A036742[n], arabic), n=1..51); # _Nathaniel Johnston_, May 18 2011
%t FromRomanNumeral[Sort[RomanNumeral[Range[3999]]]] (* _Hans Havermann_, May 06 2019; requires Mathematica 10.2+ *)
%o (Perl)
%o #!/bin/bash
%o # Requires Roman module:
%o # http://search.cpan.org/~chorny/Roman-1.20/lib/Roman.pm
%o perl -e 'use Roman; for(1..3999) { print roman($_)."
%o "; }' | sort | perl -ne 'use Roman; chomp; print arabic($_)."
%o "'
%o # Steven N. Severinghaus, Nov 17 2007
%Y Cf. A006968, A036741, A036743.
%K nonn,easy,base,look,fini,full
%O 1,1
%A _David W. Wilson_