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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097425 a(1) = 500, then a(n) is the concatenation of the roman numerals (I, V, X, L, C, D, M) visible in a(n-1) written in English. 0
500, 15500500, 1510001505011550050050015500500 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

a(1) = 500, which is fIVe hunDreD, so a(2) = concat(1, 5, 500, 500) = 15500500, which is fIVeteen MILLIon fIVe hunDreD thousanD fIVe hunDreD, so a(3) = concat(1, 5, 1000, 1, 50, 50, 1, 1, 5, 500, 500, 500, 1, 5, 500, 500), etc.

CROSSREFS

Cf. A002904, A092302.

Sequence in context: A214242 A239046 A279275 * A320206 A320215 A233429

Adjacent sequences:  A097422 A097423 A097424 * A097426 A097427 A097428

KEYWORD

nonn,word,less

AUTHOR

Pierre CAMI, Aug 21 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 22:37 EST 2019. Contains 329782 sequences. (Running on oeis4.)