The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Nathaniel Johnston, Table of n, a(n) for n = 1..3999 Stephanus Gibbs, Roman Numeral and Date Conversion 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 Cf. A054054, A094636. Sequence in context: A101025 A028315 A074062 * A220054 A263152 A075463 Adjacent sequences:  A094632 A094633 A094634 * A094636 A094637 A094638 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 29 01:30 EST 2020. Contains 332353 sequences. (Running on oeis4.)