This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A363252 #11 May 24 2023 03:55:08
%S A363252 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,
%T A363252 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,
%U A363252 4,1,3,5,1,1,1,1,2,2,1,1,2,2,4,1,1,1,2,11,2
%N A363252 a(n) = gcd(A000041(n), A000009(n)).
%p A363252 b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(
%p A363252 `if`(d::odd, d, 0), d=numtheory[divisors](j)), j=1..n)/n)
%p A363252 end:
%p A363252 a:= n-> igcd(b(n), combinat[numbpart](n)):
%p A363252 seq(a(n), n=0..120); # _Alois P. Heinz_, May 23 2023
%t A363252 Table[GCD[PartitionsP[n], PartitionsQ[n]], {n, 0, 100}]
%Y A363252 Cf. A000009, A000041, A051177, A056848, A093952, A304991.
%K A363252 nonn
%O A363252 0,8
%A A363252 _Vaclav Kotesovec_, May 23 2023, inspired by _Zhi-Wei Sun_