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 A340275 #5 Jan 03 2021 15:54:08
%S A340275 0,0,1,1,2,2,3,4,5,5,7,8,10,11,12,13,16,17,20,22,24,25,29,30,33,35,38,
%T A340275 40,45,47,52,55,58,60,64,66,72,75,79,81,88,90,97,101,105,108,116,119,
%U A340275 126,130,135,139,148,151,157,161,167,171,181,183,193,198,204,209,217,221
%N A340275 Number of partitions of n into 3 parts whose smallest two parts are relatively prime.
%H A340275 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A340275 a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} floor(1/gcd(i,k)).
%t A340275 Table[Sum[Sum[Floor[1/GCD[i, k]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}]
%Y A340275 Cf. A023023, A340276, A340278.
%K A340275 nonn
%O A340275 1,5
%A A340275 _Wesley Ivan Hurt_, Jan 02 2021