A092196 Number of letters in "old style" Roman numeral representation of n (e.g., IIII rather than IV).

0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 2

Offset

0,3

Comments

How is this sequence defined for large values? - Charles R Greathouse IV, Feb 01 2011

Also, number of abacus pieces moved (i.e., differing from their initial positions) for the expression of n on a Chinese abacus. A Chinese abacus is also called "suanpan"(CN), "soroban"(JP). - FUNG Cheok Yin, Aug 08 2017

Links

Nathaniel Johnston, Table of n, a(n) for n = 0..3999

Wikipedia, Abacus

Wikipedia, Soroban

Wikipedia, Suanpan

Index entries for sequences related to number of letters in n

Example

a(99)=10 because 99 is LXXXXVIIII.

Maple

A092196 := proc(n) return length(convert(n, roman, period=early)): end: seq(A092196(n), n=1..105); # Nathaniel Johnston, May 18 2011

Prog

(PARI) a(n)=vecsum(apply(v->(v\5)+(v%5), digits(n))); \\ Andrew Howroyd, Oct 19 2017

Crossrefs

Cf. A006968.

Sequence in context: A011542 A260688 A053344 * A100878 A145172 A338484

Adjacent sequences: A092193 A092194 A092195 * A092197 A092198 A092199

Keyword

base,easy,nonn

Author

Marc LeBrun, Feb 24 2004

Extensions

a(0)=0 prepended by Andrew Howroyd, Oct 19 2017

Status

approved