%I #24 Sep 08 2022 08:44:59
%S 0,0,9,66,345,1590,6909,29106,120465,493230,2005509,8116746,32744985,
%T 131801670,529647309,2125861986,8525167905,34165634910,136857036309,
%U 548010848826,2193789933225,8780396200950,35137287916509
%N Number of Boolean functions of n variables and rank 3 from Post class F(5,inf).
%D V. Jovovic, G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6).
%H G. C. Greubel, <a href="/A051375/b051375.txt">Table of n, a(n) for n = 1..1000</a>
%H Thomas Wieder, The number of certain k-combinations of an n-set, <a href="http://www.math.nthu.edu.tw/~amen/">Applied Mathematics Electronic Notes</a>, vol. 8 (2008).
%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (10,-35,50,-24).
%F a(n) = A036239(n) - A000918(n).
%F a(n) = (4^n - 3^n - 3*2^n + 5)/2.
%F a(n) = Sum_{j=1..n} (-1)^(j+1)*C(n, j)*C(2^(n-j)-1, k-1) (with k=3).
%F Also: 1/(k-1)!*Sum(s(k, j)*(2^((j-1)*n)-(2^(j-1)-1)^n), j=1..k), where s(k, j) are Stirling numbers of the first kind (with k=3).
%F From _Colin Barker_, Jun 25 2012: (Start)
%F a(n) = 10*a(n-1) - 35*a(n-2) + 50*a(n-3) - 24*a(n-4).
%F G.f.: 3*x^3*(3-8*x)/((1-x)*(1-2*x)*(1-3*x)*(1-4*x)). (End)
%t Table[(4^n - 3^n - 3*2^n + 5)/2, {n, 0, 50}] (* _G. C. Greubel_, Oct 08 2017 *)
%o (PARI) for(n=0,50, print1((4^n - 3^n - 3*2^n + 5)/2, ", ")) \\ _G. C. Greubel_, Oct 08 2017
%o (Magma) [(4^n - 3^n - 3*2^n + 5)/2: n in [0..50]]; // _G. C. Greubel_, Oct 08 2017
%Y Cf. A036240.
%K easy,nonn
%O 1,3
%A _Vladeta Jovovic_, Goran Kilibarda
%E More terms from _James A. Sellers_