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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119281 Number of counting rods to represent n in the ancient Chinese rod numeral system. 0
0, 1, 2, 3, 4, 5, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 4, 5, 6, 7, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 4, 5, 6, 7, 8, 9, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 7, 8, 9, 10, 2, 3, 4, 5, 6, 7, 4, 5, 6, 7, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 4, 5, 6, 7, 8, 9, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 7, 8, 9, 10, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Contrast with A092196, the number of letters to represent n in ancient Roman numerals. Negative numbers were represented by the same number of rods but usually of a different color (usually black rods with red rods for positive numbers). It's unclear to me whether 0 itself was ever formally considered represented by the absence of all counting rods, but it does seem reasonable that a(0)=0 from the example below.

LINKS

Wikipedia, Chinese numerals

Wikipedia, Counting rods

FORMULA

a(n) = a(-n) = A007953(n) - 4*A102677(n) = A092196(n) + 4*(number of 5s in n).

EXAMPLE

a(105) = 6 because 105 was represented on a counting board by placing one counting rod in the compartment for hundreds, no rods where those representing tens were normally placed and five rods in the units compartment.

PROG

(PARI) a(n)= tmp=abs(n); r=0; l=length(Str(tmp)); for(k=1, l, d=tmp-(tmp\10)*10; tmp=tmp\10; if(d<6, r=r+d, r=r+d-4)); r

CROSSREFS

Cf. A092196, A007953, A102677.

Sequence in context: A165072 A141404 A070671 * A173525 A070772 A094937

Adjacent sequences:  A119278 A119279 A119280 * A119282 A119283 A119284

KEYWORD

base,easy,nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 12 2006

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 17 16:32 EST 2012. Contains 206050 sequences.