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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002964 Smallest number requiring n chisel strokes for its representation in Roman numerals. 3
1, 2, 3, 7, 8, 17, 18, 27, 28, 37, 38, 87, 88, 187, 188, 287, 288, 387, 388, 788, 887, 888, 1388, 1788, 1887, 1888, 2388, 2788, 2887, 2888, 3388, 3788, 3887, 3888 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A002963(a(n)) = n. - Reinhard Zumkeller, Apr 14 2013

LINKS

Table of n, a(n) for n=1..34.

Eric Weisstein's World of Mathematics, Roman Numerals

Wikipedia, Roman numerals

PROG

(Haskell)

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

-- Reinhard Zumkeller, Apr 14 2013

CROSSREFS

Cf. A002963.

Sequence in context: A062269 A244508 A060121 * A166966 A247843 A181658

Adjacent sequences:  A002961 A002962 A002963 * A002965 A002966 A002967

KEYWORD

base,nonn,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Erich Friedman.

For n>13: data corrected and completed up to A002963(3888)=34 by Reinhard Zumkeller, Apr 14 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 30 06:51 EDT 2017. Contains 287302 sequences.