The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036742 Numbers <= 3999 sorted in Roman numeral lexicographic order. 4
 100, 200, 300, 301, 302, 303, 304, 309, 350, 351, 352, 353, 354, 359, 355, 356, 357, 358, 360, 361, 362, 363, 364, 369, 365, 366, 367, 368, 370, 371, 372, 373, 374, 379, 375, 376, 377, 378, 380, 381, 382, 383, 384, 389, 385, 386, 387, 388, 305, 306, 307 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Beyond 3999 the numerals are not representable in ASCII and hence sorting becomes problematic. - Steven N. Severinghaus, Nov 17 2007 LINKS Steven N. Severinghaus, Table of n, a(n) for n = 1..3999 MAPLE A036742 := sort([seq(convert(n, roman), n=1..3999)], lexorder): seq(convert(A036742[n], arabic), n=1..51); # Nathaniel Johnston, May 18 2011 MATHEMATICA FromRomanNumeral[Sort[RomanNumeral[Range[3999]]]] (* Hans Havermann, May 06 2019; requires Mathematica 10.2+ *) PROG (Perl) #!/bin/bash # Requires Roman module: # http://search.cpan.org/~chorny/Roman-1.20/lib/Roman.pm perl -e 'use Roman; for(1..3999) { print roman(\$_)." "; }' | sort | perl -ne 'use Roman; chomp; print arabic(\$_)." "' # Steven N. Severinghaus, Nov 17 2007 CROSSREFS Cf. A006968, A036741, A036743. Sequence in context: A104023 A072367 A172178 * A262198 A292450 A044332 Adjacent sequences:  A036739 A036740 A036741 * A036743 A036744 A036745 KEYWORD nonn,easy,base,look,fini,full AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 12 17:17 EDT 2020. Contains 336439 sequences. (Running on oeis4.)