id:A060588 - OEIS Search Results

Search: id:A060588

Displaying 1-1 of 1 results found.

page 1

If the final two digits of n written in base 3 are the same then this digit, otherwise mod 3-sum of these two digits.

+0
3

0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0, 1, 0, 2, 0, 2, 1, 2, 1, 0 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Index entries for sequences related to final digits of numbers`
	FORMULA	`a(n) =a(n-9) =(-[n/3]-n) mod 3 =A060587(n) mod 3.`
	EXAMPLE	`a(22)=1 since 22 is written in base 3 as 211 and the final two digits are 1; a(23)=0 since 23 is written in base 3 as 212 and the final two digits are 1 and 2 and 3-(1+2)=0.`
	CROSSREFS	`Cf. A060582.` `Sequence in context: A123724 A107016 A066057 this_sequence A102565 A076826 A137178` `Adjacent sequences: A060585 A060586 A060587 this_sequence A060589 A060590 A060591`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 04 2001`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research