login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122469 Write Roman numberals in increasing order: [I]=[1]; [I][V] = [1][5]; [I][V][X] = [1][5][10]; [I][V][X][L] = [1][5][10][50]; [I][V][X][L][C] = [1][5][10][50][100]; [I][V][X][L][C][D] = [1][5][10][50][100][500]; [I][V][X][L][C][D][M] = [1][5][10][50][100][500][1000] 0
1, 15, 1510, 151050, 151050100, 151050100500, 1510501005001000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

From a quiz.

REFERENCES

K. Russell and P. Carter, Number Puzzles, W. Foulsham and Co. Ltd. (1993).

LINKS

Table of n, a(n) for n=1..7.

CROSSREFS

Sequence in context: A223058 A200994 A209680 * A119784 A199228 A209681

Adjacent sequences:  A122466 A122467 A122468 * A122470 A122471 A122472

KEYWORD

nonn,base

AUTHOR

Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 14 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 24 06:29 EDT 2013. Contains 225617 sequences.