|
Search: id:A036240
|
|
|
| A036240 |
|
Number of 3-way interactions when 3 subsets of power set on {1..n} are chosen at random; number of Boolean functions of n variables and rank 3 from Post class F(8,inf) |
|
+0
6
|
|
| 0, 0, 12, 200, 2280, 22420, 205212, 1806000, 15522960, 131383340, 1100093412, 9138243400, 75445046040, 619838752260, 5072272077612, 41371548418400, 336519691295520, 2730963319321180, 22119245290765812, 178854325039467000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
W. W. Kokko, "Interactions", manuscript, 1983.
V. Jovovic and 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
|
1/3! (8^n-7^n-3*4^n+3*3^n+2*2^n-2).
|
|
CROSSREFS
|
Cf. A036239.
Sequence in context: A115865 A159359 A119864 this_sequence A133242 A141836 A083932
Adjacent sequences: A036237 A036238 A036239 this_sequence A036241 A036242 A036243
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
