|
| |
|
|
A007089
|
|
Numbers in base 3.
(Formerly M1960)
|
|
109
|
|
|
|
0, 1, 2, 10, 11, 12, 20, 21, 22, 100, 101, 102, 110, 111, 112, 120, 121, 122, 200, 201, 202, 210, 211, 212, 220, 221, 222, 1000, 1001, 1002, 1010, 1011, 1012, 1020, 1021, 1022, 1100, 1101, 1102, 1110, 1111, 1112, 1120, 1121, 1122, 1200, 1201, 1202, 1210, 1211
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
Nonnegative integers with no decimal digit > 2. Thus nonnegative integers in base 10 whose quadrupling by normal addition or multiplication requires no carry operation. - Rick L. Shepherd, Jun 25 2009
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n = 1..10000
The Unicode Consortium, Tai Xuan Jing Symbols
Eric Weisstein's World of Mathematics, Ternary.
Wikipedia, Ternary numeral system
|
|
|
FORMULA
|
a(0)=0, a(n) = 10*a(n/3) if n==0 (mod 3), a(n) = a(n-1) + 1 otherwise. - Benoit Cloitre, Dec 22 2002
|
|
|
MATHEMATICA
|
Table[ FromDigits[ IntegerDigits[n, 3]], {n, 0, 50}]
|
|
|
PROG
|
(PARI) a(n)=if(n<1, 0, if(n%3, a(n-1)+1, 10*a(n/3)))
(Haskell)
a007089 0 = 0
a007089 n = 10 * a007089 n' + m where (n', m) = divMod n 3
-- Reinhard Zumkeller, Feb 19 2012
|
|
|
CROSSREFS
|
Cf. A000042, A007088, A007090, A007091, A007092, A007093, A007094 & A007095.
Cf. A077267, A062756, A081603, A081604, A054635, A003137.
Sequence in context: A217072 A106518 A158304 * A159952 A136820 A136810
Adjacent sequences: A007086 A007087 A007088 * A007090 A007091 A007092
|
|
|
KEYWORD
|
base,nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane, Robert G. Wilson v
|
|
|
EXTENSIONS
|
More terms from James A. Sellers, May 01 2000
|
|
|
STATUS
|
approved
|
| |
|
|
