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 A319300 #6 Sep 17 2018 08:35:07
%S A319300 1,0,1,1,1,1,0,1,2,1,2,1,0,1,4,1,4,1,0,1,6,1,1,7,2,0,1,11,1,10,2,1,1,
%T A319300 0,1,17,1,17,4,0,1,23,2,1,1,26,4,1,0,1,37,1,36,6,2,1,0,1,53,1,53,7,2,
%U A319300 1,0,1,70,4,1,1,77,11,0,1,103,1,103,10,4,2,1
%N A319300 Irregular triangle where T(n,k) is the number of strict integer partitions of n with GCD equal to the k-th divisor of n.
%F A319300 T(n,k) = A078374(n/A027750(n,k)).
%e A319300 Triangle begins:
%e A319300 1
%e A319300 0 1
%e A319300 1 1
%e A319300 1 0 1
%e A319300 2 1
%e A319300 2 1 0 1
%e A319300 4 1
%e A319300 4 1 0 1
%e A319300 6 1 1
%e A319300 7 2 0 1
%e A319300 11 1
%e A319300 10 2 1 1 0 1
%e A319300 17 1
%e A319300 17 4 0 1
%e A319300 23 2 1 1
%e A319300 26 4 1 0 1
%e A319300 37 1
%e A319300 36 6 2 1 0 1
%e A319300 53 1
%e A319300 53 7 2 1 0 1
%t A319300 Table[Length[Select[IntegerPartitions[n],And[UnsameQ@@#,GCD@@#==k]&]],{n,20},{k,Divisors[n]}]
%Y A319300 A regular version is A303138. Row lengths are A000005. Row sums are A000009. First column is A078374.
%Y A319300 Cf. A000837, A027750, A289508, A289509, A303140, A303280, A319299, A319301.
%K A319300 nonn,tabf
%O A319300 1,9
%A A319300 _Gus Wiseman_, Sep 16 2018