A363252 a(n) = gcd(A000041(n), A000009(n)).

1, 1, 1, 1, 1, 1, 1, 5, 2, 2, 2, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 2, 3, 2, 2, 1, 4, 2, 3, 7, 2, 3, 1, 1, 1, 1, 21, 21, 2, 1, 1, 2, 6, 14, 3, 1, 2, 1, 1, 1, 1, 2, 1, 3, 4, 4, 17, 1, 2, 1, 2, 2, 4, 1, 3, 5, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 4, 1, 1, 1, 2, 11, 2

Offset: 0

Author

Vaclav Kotesovec, May 23 2023, inspired by Zhi-Wei Sun

Keywords

• nonn

Crossrefs

Cf. A000009, A000041, A051177, A056848, A093952, A304991.

Programs

Maple

b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
     `if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
    end:
a:= n-> igcd(b(n), combinat[numbpart](n)):
seq(a(n), n=0..120);  # Alois P. Heinz, May 23 2023

Mathematica

Table[GCD[PartitionsP[n], PartitionsQ[n]], {n, 0, 100}]