A279353 a(n) = A055938(n+1) XOR A055938(n).

7, 3, 15, 5, 1, 3, 31, 5, 1, 13, 3, 7, 1, 3, 63, 5, 1, 13, 3, 7, 1, 29, 3, 7, 3, 13, 1, 7, 1, 3, 127, 5, 1, 13, 3, 7, 1, 29, 3, 7, 3, 13, 1, 7, 1, 61, 3, 7, 3, 13, 1, 7, 3, 29, 1, 5, 15, 3, 1, 7, 1, 3, 255, 5, 1, 13, 3, 7, 1, 29, 3, 7, 3, 13, 1, 7, 1, 61, 3, 7, 3, 13, 1, 7, 3, 29, 1, 5, 15, 3, 1, 7, 1, 125, 3, 7, 3, 13, 1, 7, 3, 29, 1, 5, 15

Offset: 1

Author

Antti Karttunen, Mar 15 2017

Keywords

• nonn

Links

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

Crossrefs

Cf. A003987, A055938, A279340, A279357.

Programs

Mathematica

Function[t, BitXor @@ # & /@ Transpose@ {Rest@ t, Most@ t}]@ Complement[Range@ Last@ #, #] &@ Table[IntegerExponent[(2 n)!, 2], {n, 0, 112}] (* Michael De Vlieger, Mar 15 2017, after Jean-François Alcover at A055938 *)

Scheme

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

Formula

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