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!)
A094635 Smallest digit of n in Roman numeral representation. 2

%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

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)