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 A297024 #16 Dec 17 2021 18:46:30
%S A297024 0,0,0,0,2,0,5,3,6,7,14,5,20,18,19,21,35,24,44,33,44,52,65,42,72,75,
%T A297024 78,77,104,78,119,105,121,133,140,116,170,168,173,160,209,177,230,213,
%U A297024 220,250,275,224,292,282,304,305,350,312,361,342,383,403,434,357
%N A297024 Sum of the smaller parts of the partitions of n into two parts such that the smaller part does not divide the larger.
%H A297024 Muniru A Asiru, <a href="/A297024/b297024.txt">Table of n, a(n) for n = 1..1000</a>
%H A297024 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A297024 a(n) = Sum_{i=1..floor(n/2)} i * (1-(floor(n/i)-floor((n-1)/i))).
%e A297024 a(10) = 7; the partitions of 10 into two parts are (9,1), (8,2), (7,3), (6,4), (5,5). The sum of the smaller parts that do not divide their larger counterparts is then 3 + 4 = 7.
%t A297024 Table[Sum[i (1 - (Floor[n/i] - Floor[(n - 1)/i])), {i, Floor[n/2]}], {n, 100}]
%t A297024 f[n_] := Plus @@ Select[ Range[n/2], !MemberQ[Divisors[n], #] &]; Array[f, 60] (* _Robert G. Wilson v_, Dec 23 2017 *)
%t A297024 Table[Total[Select[IntegerPartitions[n,{2}],Mod[#[[1]],#[[2]]]!=0&][[All,2]]],{n,60}] (* _Harvey P. Dale_, Dec 17 2021 *)
%o A297024 (GAP) List(List(List([1..10^2], n-> Partitions(n,2)), i -> Filtered(i, j -> j[1] mod j[2] <> 0)), m->Sum(m, k -> k[2])); # _Muniru A Asiru_, Jan 28 2018
%Y A297024 Cf. A296955.
%K A297024 nonn,easy
%O A297024 1,5
%A A297024 _Wesley Ivan Hurt_, Dec 23 2017