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 A297053 #12 Feb 10 2018 22:00:33
%S A297053 0,0,0,0,3,0,9,5,12,13,30,7,45,38,41,43,84,48,108,67,103,124,165,78,
%T A297053 178,185,192,175,273,162,315,247,308,343,350,244,459,440,451,360,570,
%U A297053 411,630,535,545,670,759,496,786,718,818,787,975,768,959,834,1042
%N A297053 Sum of the larger parts of the partitions of n into two parts such that the smaller part does not divide the larger.
%H A297053 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A297053 a(n) = Sum_{i=1..floor(n/2)} (n-i) * (1 - (floor(n/i) - floor((n-1)/i))).
%e A297053 a(10) = 13; the partitions of 10 into two parts are (9,1), (8,2), (7,3), (6,4) and (5,5). The sum of the larger parts of these partitions such that the smaller part does not divide the larger is then 7 + 6 = 13.
%t A297053 Table[Sum[(n - i) (1 - (Floor[n/i] - Floor[(n - 1)/i])), {i, Floor[n/2]}], {n, 80}]
%Y A297053 Cf. A297024.
%K A297053 nonn,easy
%O A297053 1,5
%A A297053 _Wesley Ivan Hurt_, Dec 24 2017