A279357 a(n) = A005187(n) XOR A005187(n+1).

1, 2, 7, 3, 15, 2, 1, 4, 31, 2, 1, 5, 1, 14, 3, 5, 63, 2, 1, 5, 1, 14, 3, 4, 1, 30, 3, 7, 3, 14, 1, 6, 127, 2, 1, 5, 1, 14, 3, 4, 1, 30, 3, 7, 3, 14, 1, 7, 1, 62, 3, 7, 3, 14, 1, 4, 3, 30, 1, 5, 1, 2, 15, 7, 255, 2, 1, 5, 1, 14, 3, 4, 1, 30, 3, 7, 3, 14, 1, 7, 1, 62, 3, 7, 3, 14, 1, 4, 3, 30, 1, 5, 1, 2, 15, 6, 1, 126, 3, 7, 3, 14, 1, 4, 3, 30

Offset: 0

Author

Antti Karttunen, Mar 15 2017

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..8191

Crossrefs

Cf. A001511, A003987, A005187, A279353.

Programs

Mathematica

Function[t, BitXor @@ # & /@ Transpose@ {Most@ t, Rest@ t}]@ Table[2 n - DigitCount[2 n, 2, 1], {n, 0, 106}] (* Michael De Vlieger, Mar 15 2017, after Harvey P. Dale at A005187 *)

Scheme

(define (A279357 n) (A003987bi (A005187 (+ 1 n)) (A005187 n))) ;; Here A003987bi implements a bitwise-XOR (A003987).

Formula

a(n) = A005187(n) XOR A005187(n+1).