id:A134024 - OEIS Search Results

Search: id:A134024

Displaying 1-1 of 1 results found.

page 1

Number of positive trits in balanced ternary representation of n.

+0
4

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

	OFFSET	`0,5`
	COMMENT	`a(n) = A134021(n) - A134022(n) - A134023(n);` `a(n) > 0 for n>0.`
	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)=3;` `200=13^5-13^4+13^3+13^2+13^1-13^0=='+-+++-': a(200)=4;` `300=13^5+13^4-13^3+03^2+13^1+0*3^0=='++-0+0': a(300)=3.`
	CROSSREFS	`Adjacent sequences: A134021 A134022 A134023 this_sequence A134025 A134026 A134027` `Sequence in context: A025849 A088782 A066672 this_sequence A029316 A104368 A012257`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2007`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research