|
| |
|
|
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; 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. A094636, A054054.
Sequence in context: A101025 A028315 A074062 * A075463 A026518 A051008
Adjacent sequences: A094632 A094633 A094634 * A094636 A094637 A094638
|
|
|
KEYWORD
| nonn,easy,base
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 17 2004
|
| |
|
|
