A284582 a(n) = gcd(A227349(n), A227350(n)).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1

Offset: 0

Author

Antti Karttunen, Apr 14 2017

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10922
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A167489, A227349, A227350, A284583.

Programs

Scheme

(define (A284582 n) (gcd (A227349 n) (A227350 n)))

Formula

a(n) = gcd(A227349(n), A227350(n)).

A167489(n) = a(n) * A284583(n).