login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002964 Smallest number requiring n chisel strokes for its representation in Roman numerals. 3

%I #16 Jan 31 2022 01:10:56

%S 1,2,3,7,8,17,18,27,28,37,38,87,88,187,188,287,288,387,388,788,887,

%T 888,1388,1788,1887,1888,2388,2788,2887,2888,3388,3788,3887,3888

%N Smallest number requiring n chisel strokes for its representation in Roman numerals.

%C A002963(a(n)) = n. - _Reinhard Zumkeller_, Apr 14 2013

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/RomanNumerals.html">Roman Numerals</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Roman_numerals">Roman numerals</a>

%o (Haskell)

%o a002964 = (+ 1) . fromJust . (`elemIndex` (map a002963 [1..3888]))

%o -- _Reinhard Zumkeller_, Apr 14 2013

%Y Cf. A002963.

%K base,nonn,nice

%O 1,2

%A _N. J. A. Sloane_

%E More terms from _Erich Friedman_

%E For n>13: data corrected and completed up to A002963(3888)=34 by _Reinhard Zumkeller_, Apr 14 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:00 EDT 2024. Contains 371797 sequences. (Running on oeis4.)