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 A319164 #5 Sep 15 2018 15:47:48
%S A319164 0,0,0,1,0,2,0,2,1,2,0,5,0,2,2,5,0,6,0,9,2,2,0,17,1,2,3,17,0,18,0,22,
%T A319164 2,2,2,48,0,2,2,48,0,34,0,58,11,2,0,111,1,14,2,103,0,65,2,141,2,2,0,
%U A319164 264,0,2,19,231,2,116,0,299,2,42
%N A319164 Number of integer partitions of n that are neither relatively prime nor aperiodic.
%C A319164 A partition is aperiodic if its multiplicities are relatively prime.
%e A319164 The a(24) = 17 integer partitions:
%e A319164 (12,12),
%e A319164 (8,8,8),
%e A319164 (6,6,6,6), (8,8,4,4), (9,9,3,3), (10,10,2,2),
%e A319164 (4,4,4,4,4,4), (6,6,3,3,3,3), (6,6,4,4,2,2), (6,6,6,2,2,2), (8,8,2,2,2,2),
%e A319164 (3,3,3,3,3,3,3,3), (4,4,4,4,2,2,2,2), (6,6,2,2,2,2,2,2),
%e A319164 (4,4,4,2,2,2,2,2,2),
%e A319164 (4,4,2,2,2,2,2,2,2,2),
%e A319164 (2,2,2,2,2,2,2,2,2,2,2,2).
%t A319164 Table[Length[Select[IntegerPartitions[n],And[GCD@@#>1,GCD@@Length/@Split[#]>1]&]],{n,30}]
%Y A319164 Cf. A000837, A018783, A047966, A098859, A100953, A305563, A319149, A319160, A319162, A319165.
%K A319164 nonn
%O A319164 1,6
%A A319164 _Gus Wiseman_, Sep 12 2018