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”).

A094635
Smallest digit of n in Roman numeral representation.
2
1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 50, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5, 1, 1, 1, 1, 10, 1, 1, 1, 1, 5
OFFSET
1,5
LINKS
Eric Weisstein's World of Mathematics, Roman Numerals
EXAMPLE
I,I,I,I,V,I,I,I,I,X,I,I,I,I,V,I,I,I,I,X,I,I,I,I,V,I, ...
MAPLE
A094635 := 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 min(op(s)): end: seq(A094635(n), n=1..100); # Nathaniel Johnston, May 18 2011
CROSSREFS
Sequence in context: A101025 A028315 A074062 * A358347 A367989 A220054
KEYWORD
nonn,easy,base
AUTHOR
Reinhard Zumkeller, May 17 2004
STATUS
approved