A092196 - OEIS

This site is supported by donations to The OEIS Foundation.

A092196

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

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 (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]`
	LINKS	`Nathaniel Johnston, Table of n, a(n) for n = 1..3999` `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`
	CROSSREFS	`Cf. A006968.` `Sequence in context: A010883 A011542 A053344 * A100878 A145172 A053824` `Adjacent sequences: A092193 A092194 A092195 * A092197 A092198 A092199`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Feb 24 2004`

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

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.