login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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