A339969 a(n) = gcd(n, A005940(1+n)).

1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 3, 1, 1, 1, 25, 1, 9, 1, 1, 3, 1, 1, 11, 1, 7, 1, 1, 1, 1, 1, 1, 21, 1, 1, 45, 1, 1, 1, 49, 1, 1, 1, 1, 9, 1, 7, 1, 1, 1, 5, 1, 1, 1, 1, 13, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 7, 3, 1, 1, 1, 1, 1, 7, 5, 1, 3, 11, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 1, 5

Offset: 0

Author

Antti Karttunen, Dec 25 2020

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 0..16384
• Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A005940.

Cf. also A322361, A324198, A328231.

Programs

PARI

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };
A339969(n) = gcd(n, A005940(1+n));

Formula

a(n) = gcd(n, A005940(1+n)).