A060582 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	LINKS	`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: A029375 A071462 A101979 * A060450 A180918 A152146` `Adjacent sequences: A060579 A060580 A060581 * A060583 A060584 A060585`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 04 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 16:00 EST 2012. Contains 205938 sequences.