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 A340286 #4 Jan 03 2021 15:55:09
%S A340286 0,0,0,0,1,1,3,2,5,4,8,5,12,8,15,13,20,12,26,17,30,25,37,22,45,33,50,
%T A340286 39,60,32,71,50,75,58,86,54,100,71,104,79,122,68,136,95,138,112,159,
%U A340286 92,175,119,181,140,203,116,217,157,225,176,251,133,274,195,273,212,300
%N A340286 Number of partitions of n into 3 parts such that at least two parts share a common factor > 1.
%H A340286 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A340286 a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} (1 - [gcd(k,i) * gcd(k,n-i-k) * gcd(i,n-i-k) = 1]), where [ ] is the Iverson bracket.
%t A340286 Table[Sum[Sum[1 - Floor[1/GCD[k, i]]*Floor[1/GCD[k, n - i - k]]* Floor[1/GCD[i, n - i - k]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 80}]
%Y A340286 Cf. A307719.
%K A340286 nonn
%O A340286 1,7
%A A340286 _Wesley Ivan Hurt_, Jan 03 2021