%I #6 Oct 22 2021 20:56:39
%S 0,0,1,1,2,3,3,4,6,6,6,9,9,10,12,12,13,16,15,18,20,19,19,24,25,25,27,
%T 28,28,33,31,34,37,36,38,42,41,42,44,47,47,52,50,53,57,54,54,61,62,64,
%U 65,66,66,71,71,74,76,75,75,84,82,83,87,87,90,93,91,94,96,99,97,106
%N Number of partitions of n into 3 parts whose smallest part divides the largest part.
%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F a(n) = Sum_{j=1..floor(n/3)} Sum_{i=j..floor((n-j)/2)} (1 - ceiling((n-i-j)/j) + floor((n-i-j)/j)).
%t a[n_] := Sum[1 - Ceiling[(n - i - j)/j] + Floor[(n - i - j)/j], {j, 1, Floor[n/3]}, {i, j, Floor[(n - j)/2]}]; Array[a, 100] (* _Amiram Eldar_, Oct 22 2021 *)
%K nonn
%O 1,5
%A _Wesley Ivan Hurt_, Oct 21 2021