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 A305736 #13 Feb 12 2022 20:30:59
%S A305736 0,0,0,1,0,1,0,2,1,1,0,4,0,1,1,5,0,4,0,8,1,1,0,14,1,1,3,16,0,10,0,22,
%T A305736 1,1,1,41,0,1,1,45,0,18,0,57,9,1,0,94,1,8,1,102,0,38,1,138,1,1,0,221,
%U A305736 0,1,17,231,1,59,0,298,1,22
%N A305736 Number of integer partitions of n whose greatest common divisor is composite (nonprime and > 1).
%H A305736 Andrew Howroyd, <a href="/A305736/b305736.txt">Table of n, a(n) for n = 1..1000</a>
%F A305736 a(n) = A018783(n) - A305735(n). - _Andrew Howroyd_, Jun 22 2018
%e A305736 The a(12) = 4 integer partitions are (12), (8 4), (6 6), (4 4 4).
%t A305736 Table[Length[Select[IntegerPartitions[n],!(GCD@@#==1||PrimeQ[GCD@@#])&]],{n,0,20}]
%o A305736 (PARI) seq(n)={dirmul(vector(n, n, numbpart(n)), dirmul(vector(n, n, moebius(n)), vector(n, n, n>1&&!isprime(n))))} \\ _Andrew Howroyd_, Jun 22 2018
%Y A305736 Cf. A000040, A000837, A018783, A100953, A289508, A302698, A305563, A305731, A305735.
%K A305736 nonn
%O A305736 1,8
%A A305736 _Gus Wiseman_, Jun 22 2018