|
| |
|
|
A051375
|
|
Number of Boolean functions of n variables and rank 3 from Post class F(5,inf).
|
|
1
| |
|
|
0, 0, 9, 66, 345, 1590, 6909, 29106, 120465, 493230, 2005509, 8116746, 32744985, 131801670, 529647309, 2125861986, 8525167905, 34165634910, 136857036309, 548010848826, 2193789933225, 8780396200950, 35137287916509
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| 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).
|
|
|
LINKS
| Thomas Wieder, The number of certain k-combinations of an n-set, Applied Mathematics Electronic Notes, vol. 8 (2008).
Index entries for sequences related to Boolean functions
|
|
|
FORMULA
| Sum((-1)^(j+1)*C(n, j)*C(2^(n-j)-1, k-1), j=1..n) (with k=3).
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).
|
|
|
CROSSREFS
| A051375(n)=A036239(n)-A000918(n)=1/2! (4^n-3^n-3*2^n+5). Cf. A036240.
Sequence in context: A152581 A122733 A118465 * A081902 A002695 A003408
Adjacent sequences: A051372 A051373 A051374 * A051376 A051377 A051378
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs)
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu)
|
| |
|
|
