login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093783 Sum of digits of n in Roman numeral representation. 3
1, 2, 3, 6, 5, 6, 7, 8, 11, 10, 11, 12, 13, 16, 15, 16, 17, 18, 21, 20, 21, 22, 23, 26, 25, 26, 27, 28, 31, 30, 31, 32, 33, 36, 35, 36, 37, 38, 41, 60, 61, 62, 63, 66, 65, 66, 67, 68, 71, 50, 51, 52, 53, 56, 55, 56, 57, 58, 61, 60, 61, 62, 63, 66, 65, 66, 67, 68 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

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

n=42 == XLII: a(42) = 'X' + 'L' + 'I' + 'I' = 10+50+1+1 = 62.

MAPLE

A093783 := proc(n) local r: r:=convert(n, roman): return add(convert(r[j], arabic), j=1..length(r)): end: seq(A093783(n), n=1..68); # Nathaniel Johnston, May 18 2011

CROSSREFS

Cf. A007953, A057226, A006968.

Sequence in context: A137761 A100769 A023889 * A096861 A118738 A175067

Adjacent sequences:  A093780 A093781 A093782 * A093784 A093785 A093786

KEYWORD

nonn,easy,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 17 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 18:02 EST 2012. Contains 205533 sequences.