A361099 - OEIS

%I #22 Jun 10 2024 08:49:38

%S 0,1,4,12,32,75,156,294,512,837,1300,1936,2784,3887,5292,7050,9216,

%T 11849,15012,18772,23200,28371,34364,41262,49152,58125,68276,79704,

%U 92512,106807,122700,140306,159744,181137,204612,230300,258336,288859,322012,357942,396800,438741

%N a(n) = n + 2*binomial(n,2) + 3*binomial(n,3) + 4*binomial(n,4).

%C a(n) is the number of ordered set partitions of an n-set into 2 sets such that the first set has either 3, 2, 1 or no elements, the second set has no restrictions, and an element is selected from the second set.

%H Paolo Xausa, <a href="/A361099/b361099.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).

%F E.g.f.: (1 + x + x^2/2 + x^3/6)*x*exp(x).

%F From _Stefano Spezia_, Mar 04 2023: (Start)

%F O.g.f.: x*(1 - x + 2*x^2 + 2*x^3)/(1 - x)^5.

%F a(n) = A000290(n) + A004320(n-2). (End)

%e The 294 set partitions for n=7 are the following (where the element selected from the second set is in parentheses):

%e { }, {(1),2,3,4,5,6,7}  (7 of these);

%e {1}, {(2),3,4,5,6,7}   (42 of these);

%e {1,2}, {(3),4,5,6,7}   (105 of these);

%e {1,2,3}, {(4),5,6,7}   (140 of these).

%t Table[n^2*(n*(n - 3) + 8)/6, {n, 0, 50}] (* _Paolo Xausa_, Jun 10 2024 *)

%o (Python)

%o def A361099(n): return n**2*(n*(n - 3) + 8)//6 # _Chai Wah Wu_, Mar 24 2023

%Y Cf. A000290, A004320.

%K nonn,easy

%O 0,3

%A _Enrique Navarrete_, Mar 01 2023