id:A065368 - OEIS Search Results

Search: id:A065368

Displaying 1-1 of 1 results found.

page 1

Alternating sum of ternary digits in n. Replace 3^k with (-1)^k in ternary expansion of n.

+0
3

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

	OFFSET	`1,2`
	COMMENT	`Notation: (3)[n](-1)`
	EXAMPLE	`15 = +1(9)+2(3)+0(1) -> +1(+1)+2(-1)+0(+1) = -1 = a(15)`
	CROSSREFS	`A053735, A065359, A065364` `Sequence in context: A118825 A118822 A054848 this_sequence A010751 A029370 A106262` `Adjacent sequences: A065365 A065366 A065367 this_sequence A065369 A065370 A065371`
	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 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research