A327857 a(n) = A091255(1+A059905(n), 1+A059906(n)).

1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 3, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 3, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 4, 5, 3, 3, 6, 1, 1, 1, 2, 1, 1, 1, 2, 7, 1, 1, 8, 1, 1, 1, 2, 1, 1, 1, 2, 3, 3, 1, 2, 1, 3, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 4, 3, 5, 3, 6, 1, 3, 1, 6, 7, 1

Offset: 0

Author

Antti Karttunen, Sep 28 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384
• Index entries for sequences operating on polynomials in ring GF(2)[X]

Crossrefs

Cf. A059905, A059906, A091255.

Programs

PARI

A059905(n) = { my(t=1,s=0); while(n>0, s += (n%2)*t; n \= 4; t *= 2); (s); };
A059906(n) = { my(t=1,s=0); while(n>0, s += ((n%4)>=2)*t; n \= 4; t *= 2); (s); };
A091255sq(a,b) = fromdigits(Vec(lift(gcd(Pol(binary(a))*Mod(1, 2),Pol(binary(b))*Mod(1, 2)))),2);
A327857(n) = A091255sq(1+A059905(n), 1+A059906(n));

Formula

a(n) = A091255(1+A059905(n), 1+A059906(n)) = A091255(1+A059906(n), 1+A059905(n)).