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”).
%I #13 Aug 15 2017 03:16:30
%S 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,
%T 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,
%U 1,1,1,10,1,1,1,1,5,1,1,1,1,10,1,1,1,1,5
%N Smallest digit of n in Roman numeral representation.
%H Nathaniel Johnston, <a href="/A094635/b094635.txt">Table of n, a(n) for n = 1..3999</a>
%H Stephanus Gibbs, <a href="http://www.softhawkway.com/rcalc.htm">Roman Numeral and Date Conversion</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/RomanNumerals.html">Roman Numerals</a>
%e 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, ...
%p 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
%Y Cf. A054054, A094636.
%K nonn,easy,base
%O 1,5
%A _Reinhard Zumkeller_, May 17 2004