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 A348542 #8 Oct 22 2021 20:58:28
%S A348542 0,0,0,1,1,3,2,5,4,8,6,12,9,16,12,21,16,27,20,33,25,40,30,48,36,56,42,
%T A348542 65,49,75,56,85,64,96,72,108,81,120,90,133,100,147,110,161,121,176,
%U A348542 132,192,144,208,156,225,169,243,182,261,196,280,210,300,225,320,240,341,256,363
%N A348542 Number of partitions of n into 3 parts where at least one part is even.
%H A348542 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F A348542 a(n) = Sum_{j=1..floor(n/3)} Sum_{i=j..floor((n-j)/2)} (1-(i mod 2)*(j mod 2)*((n-i-j) mod 2)).
%t A348542 a[n_] := Sum[1 - Mod[i, 2] * Mod[j, 2] * Mod[n - i - j, 2], {j, 1, Floor[n/3]}, {i, j, Floor[(n - j)/2]}]; Array[a, 100] (* _Amiram Eldar_, Oct 22 2021 *)
%Y A348542 Cf. A069905.
%K A348542 nonn
%O A348542 1,6
%A A348542 _Wesley Ivan Hurt_, Oct 21 2021