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

A065081

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

Terms

    a(0) =-1a(1) =0a(2) =2a(3) =1a(4) =-1a(5) =1a(6) =2a(7) =1a(8) =2a(9) =2a(10) =1a(11) =1a(12) =-1a(13) =-2a(14) =-1a(15) =2a(16) =-1a(17) =1a(18) =1a(19) =2a(20) =1a(21) =1a(22) =2a(23) =2a(24) =1a(25) =2a(26) =1a(27) =-1a(28) =1a(29) =2

External references