|
| |
|
|
A006968
|
|
Number of letters in Roman numeral representation of n.
(Formerly M0417)
|
|
30
| |
|
|
1, 2, 3, 2, 1, 2, 3, 4, 2, 1, 2, 3, 4, 3, 2, 3, 4, 5, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 4, 3, 4, 5, 6, 5, 4, 5, 6, 7, 5, 2, 3, 4, 5, 4, 3, 4, 5, 6, 4, 1, 2, 3, 4, 3, 2, 3, 4, 5, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 4, 3, 4, 5, 6, 5, 4, 5, 6, 7, 5, 4, 5, 6, 7, 6, 5, 6, 7, 8, 6, 2, 3, 4, 5, 4, 3, 4, 5, 6, 4, 1, 2, 3, 4, 3, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| How is this sequence defined for large values? [From Charles R Greathouse IV, Feb 1 2011]
|
|
|
REFERENCES
| Netnews group rec.puzzles, Frequently Asked Questions (FAQ) file. (Science Section).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 1..3999
Rec.puzzles, Archive
Gerard Schildberger, The first 3999 numbers in Roman numerals
Eric Weisstein's World of Mathematics, Roman Numeral
Index entries for sequences related to number of letters in n
|
|
|
MAPLE
| A006968 := proc(n) return length(convert(n, roman)): end: seq(A006968(n), n=1..105); # Nathaniel Johnston, May 18 2011
|
|
|
MATHEMATICA
| a[n_] := StringLength[ IntegerString[ n, "Roman"]]; Table[a[n], {n, 1, 105}] (* From Jean-François Alcover, Dec 27 2011 *)
|
|
|
PROG
| (R) as.roman(1 :1024) [From N. J. A. Sloane, Aug 23 2009]
|
|
|
CROSSREFS
| Cf. A092196.
Sequence in context: A098236 A152978 A118121 * A058207 A105969 A163530
Adjacent sequences: A006965 A006966 A006967 * A006969 A006970 A006971
|
|
|
KEYWORD
| nonn,base,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Eric Weisstein (eric(AT)weisstein.com)
|
| |
|
|
