id:A036742 - OEIS Search Results

Search: id:A036742

Displaying 1-1 of 1 results found.

page 1

Numbers <= 3999 sorted in Roman numeral lexicographic order.

+0
2

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; listen)

	OFFSET	`1,1`
	COMMENT	`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`
	PROGRAM	`#!/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. A036741, A006968.` `Adjacent sequences: A036739 A036740 A036741 this_sequence A036743 A036744 A036745` `Sequence in context: A068805 A104023 A072367 this_sequence A044332 A043490 A044713`
	KEYWORD	`nonn,base`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research