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 A339446 #8 Jan 15 2022 21:49:18
%S A339446 1,0,0,0,2,2,2,2,2,2,2,8,8,14,14,20,20,26,26,32,32,62,62,92,116,146,
%T A339446 170,224,248,302,350,404,452,530,698,776,968,1166,1478,1700,2132,2474,
%U A339446 3050,3512,4208,4814,5750,6476,7556,8522,10562,11672,13952,16022,19286,22316,26540
%N A339446 Number of compositions (ordered partitions) of n into distinct parts such that the smallest part is equal to the number of parts.
%H A339446 Seiichi Manyama, <a href="/A339446/b339446.txt">Table of n, a(n) for n = 1..1000</a>
%H A339446 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A339446 G.f.: Sum_{k>=1} k! * x^(k*(3*k - 1)/2) / Product_{j=1..k-1} (1 - x^j).
%e A339446 a(12) = 8 because we have [10, 2], [2, 10], [5, 4, 3], [5, 3, 4], [4, 5, 3], [4, 3, 5], [3, 5, 4] and [3, 4, 5].
%t A339446 nmax = 60; CoefficientList[Series[Sum[k! x^(k (3 k - 1)/2)/Product[1 - x^j, {j, 1, k - 1}], {k, 1, nmax}], {x, 0, nmax}], x] // Rest
%Y A339446 Cf. A006141, A032020, A096401, A098133.
%K A339446 nonn
%O A339446 1,5
%A A339446 _Ilya Gutkovskiy_, Dec 05 2020