id:A134452 - OEIS Search Results

Search: id:A134452

Displaying 1-1 of 1 results found.

page 1

Balanced ternary digital root of n.

+0
7

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

	OFFSET	`0,1`
	COMMENT	`a(A005843(n))=0; a(A134453(n))=-1; a(A134454(n))=1; ABS(a(A005408(n)))=1;` `ABS(a(n)) = A000035(n)).`
	REFERENCES	`D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, Vol 2, pp 173-175.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000` `Eric Weisstein's World of Mathematics, Digital Root` `Wikipedia, Balanced Ternary`
	FORMULA	`a(n) = f(n) where f(n) = if n<-1 then f(-A065363(-n)) else (if n>1 then f(A065363(n)) else n).`
	EXAMPLE	`42 == '+---0' --> +1-1-2-1+0=-2 == '-+' --> -1+1=0;` `43 == '+---+' --> +1-1-2-1+1=-1;`
	CROSSREFS	`Cf. A134451.` `Sequence in context: A125122 A000035 A131734 this_sequence A071029 A071030 A073445` `Adjacent sequences: A134449 A134450 A134451 this_sequence A134453 A134454 A134455`
	KEYWORD	`sign`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 27 2007`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research