|
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Beyond 3999 the numerals are not representable in ASCII and hence sorting becomes problematic. - Steven N. Severinghaus
|
|
|
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
|
|
|
PROG
| #!/bin/bash
# Perl program from Steven N. Severinghaus, Nov 17 2007. 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($_)."
"'
|
|
|
CROSSREFS
| Cf. A006968, A036741, A036743.
Sequence in context: A104023 A072367 A172178 * A044332 A166731 A043490
Adjacent sequences: A036739 A036740 A036741 * A036743 A036744 A036745
|
|
|
KEYWORD
| nonn,easy,base
|
|
|
AUTHOR
| David W. Wilson (davidwwilson(AT)comcast.net)
|
| |
|
|
