%I A036742
%S A036742 100,200,300,301,302,303,304,309,350,351,352,353,354,359,355,356,357,
%T A036742 358,360,361,362,363,364,369,365,366,367,368,370,371,372,373,374,379,
%U A036742 375,376,377,378,380,381,382,383,384,389,385,386,387,388,305,306,307
%N A036742 Numbers <= 3999 sorted in Roman numeral lexicographic order.
%C A036742 Beyond 3999 the numerals are not representable in ASCII and hence sorting 
               becomes problematic. - Steven N. Severinghaus
%H A036742 Steven N. Severinghaus, <a href="b036742.txt">Table of n, a(n) for n 
               = 1..3999</a>
%o A036742 #!/bin/bash
%o A036742 # Perl program from Steven N. Severinghaus, Nov 17 2007. Requires Roman 
               module:
%o A036742 # http://search.cpan.org/~chorny/Roman-1.20/lib/Roman.pm
%o A036742 perl -e 'use Roman; for(1..3999) { print roman($_)."
%o A036742 "; }' | sort | perl -ne 'use Roman; chomp; print arabic($_)."
%o A036742 "'
%Y A036742 Cf. A036741, A006968.
%Y A036742 Sequence in context: A068805 A104023 A072367 this_sequence A044332 A166731 
               A043490
%Y A036742 Adjacent sequences: A036739 A036740 A036741 this_sequence A036743 A036744 
               A036745
%K A036742 nonn,base
%O A036742 1,1
%A A036742 David W. Wilson (davidwwilson(AT)comcast.net)