id:A065363 - OEIS Search Results

Search: id:A065363

Displaying 1-1 of 1 results found.

page 1

Sum of balanced ternary digits in n. Replace 3^k with 1 in balanced ternary expansion of n.

+0
6

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

	OFFSET	`0,5`
	COMMENT	`Notation: (3)<n>(1)` `Extension to negative n: a(-n) = -a(n). [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 13 2009]`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000`
	FORMULA	`G.f. 1/(1-x)Sum_{k>=0} (x^3^k-x^(23^k))/(x^((3^k-1)/2)(1+x^3^k+x^(23^k))) [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 13 2009]`
	EXAMPLE	`5 = + 1(9)-1(3)-1(1) -> +1-1-1 = -1 = a(5)`
	CROSSREFS	`Cf. A065364, A053735. See A134452 for iterations.` `Sequence in context: A097468 A098381 A030372 this_sequence A119995 A062756 A165577` `Adjacent sequences: A065360 A065361 A065362 this_sequence A065364 A065365 A065366`
	KEYWORD	`base,easy,sign`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Oct 31 2001`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research