login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094636 Largest digit of n in Roman numeral representation. 2
1, 1, 1, 5, 5, 5, 5, 5, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Eric Weisstein's World of Mathematics, Roman Numerals
EXAMPLE
I,I,I,V,V,V,V,V,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X,X, ...
MAPLE
A094636 := proc(n) local j, r, s: r:=convert(n, roman): s:=[]: for j from 1 to length(r) do s:=[op(s), convert(r[j], arabic)]: od: return max(op(s)): end: seq(A094636(n), n=1..100); # Nathaniel Johnston, May 18 2011
CROSSREFS
Sequence in context: A117878 A291497 A241154 * A105247 A245357 A001735
KEYWORD
nonn,easy,base
AUTHOR
Reinhard Zumkeller, May 17 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:09 EDT 2024. Contains 371922 sequences. (Running on oeis4.)