id:A065081 - OEIS Search Results

Search: id:A065081

Displaying 1-1 of 1 results found.

page 1

Alternating bit sum (A065359) for n-th prime p: replace 2^k with (-1)^k in binary expansion of p.

+0
2

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

	OFFSET	`1,3`
	COMMENT	`Only 3d = 11b has an alternating sum of 0.`
	LINKS	`William Paulsen, wpaulsen(AT)csm.astate.edu, Partitioning the [prime] maze`
	EXAMPLE	`The sixth prime is 13d = 1101b -> -(1)+(1)-(0)+(1) = 1 = a(6)`
	MATHEMATICA	`f[n_] := (d = Reverse[ IntegerDigits[n, 2]]; l = Length[d]; s = 0; k = 1; While[k < l + 1, s = s - (-1)^k*d[[k]]; k++ ]; s); Table[ Prime[ f[n]], {n, 1, 100} ]`
	CROSSREFS	`Cf. A065359.` `Adjacent sequences: A065078 A065079 A065080 this_sequence A065082 A065083 A065084` `Sequence in context: A064693 A072085 A054868 this_sequence A025909 A025899 A025869`
	KEYWORD	`base,easy,sign`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 09 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research