A060582 If the final digit of n in base 3 is the same as a([n/3]) then this digit, otherwise a(n)= mod 3-sum of these two digits, with a(0)=0.

0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2

Offset

0,2

Links

Table of n, a(n) for n=0..104.

Index entries for sequences related to final digits of numbers

Formula

a(n) =(-a([n/3])-n) mod 3 =A060583(n) mod 3.

Example

a(4)=0 since a([4/3])=a(1)=2, (4 mod 3)=1 and 3-2-1=0. a(5)=2 since a([5/3])=a(1)=2 and (5 mod 3)=2.

Crossrefs

Cf. A060588.

Sequence in context: A369241 A308061 A339448 * A060450 A180918 A152146

Adjacent sequences: A060579 A060580 A060581 * A060583 A060584 A060585

Keyword

base,nonn

Author

Henry Bottomley, Apr 04 2001

Status

approved