OFFSET
1,2
COMMENTS
The Roman numeration system used here is the naive one taught in primary school. This sequence, like many others involving numeration systems, is neither well-defined nor interesting for large values of n. - N. J. A. Sloane, Jul 03 2008
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 1..199 (complete up to 3999)
Paul Lewis, Roman numerals
FORMULA
EXAMPLE
15 = XV has length 2 in both notations.
MAPLE
for n from 1 to 3999 do if(length(convert(n, roman)) <= length(n))then printf("%d, ", n): fi: od: # Nathaniel Johnston, May 18 2011
MATHEMATICA
Select[Range[560], StringLength[IntegerString[#, "Roman"]]<= IntegerLength[ #]&] (* Harvey P. Dale, Dec 18 2011 *)
PROG
(Haskell)
a036788 n = a036788_list !! (n-1)
a036788_list = [x | x <- [1..], a006968 x <= a055642 x]
-- Reinhard Zumkeller, Apr 20 2013
CROSSREFS
KEYWORD
nonn,base,easy,nice
AUTHOR
EXTENSIONS
Corrected and extended by Larry Reeves (larryr(AT)acm.org), Sep 25 2000
STATUS
approved