id:A134023 - OEIS Search Results

Search: id:A134023

Displaying 1-1 of 1 results found.

page 1

Number of zero trits in balanced ternary representation of n.

+0
5

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

	OFFSET	`0,10`
	COMMENT	`a(n) = A134021(n) - A134022(n) - A134024(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` `Wikipedia, Balanced Ternary`
	EXAMPLE	`100=13^4+13^3-13^2+03^1+13^0=='++-0+': a(100)=1;` `200=13^5-13^4+13^3+13^2+13^1-13^0=='+-+++-': a(200)=0;` `300=13^5+13^4-13^3+03^2+13^1+0*3^0=='++-0+0': a(300)=2.`
	CROSSREFS	`Sequence in context: A061007 A085252 A073423 this_sequence A015738 A115604 A128617` `Adjacent sequences: A134020 A134021 A134022 this_sequence A134024 A134025 A134026`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2007`

page 1

Search completed in 0.002 seconds

Last modified July 23 10:48 EDT 2008. Contains 142285 sequences.

AT&T Labs Research