|
Search: id:A001320
|
|
|
| A001320 |
|
Number of self-complementary Boolean functions of n variables.
(Formerly M2982 N1204)
|
|
+0
2
|
|
| 1, 3, 14, 240, 63488, 4227858432, 18302628885633695744, 338953138925153547590470800371487866880, 115565932813024562229384322928592814283244066726840484812818018414147674308608
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.
|
|
LINKS
|
Index entries for sequences related to Boolean functions
|
|
FORMULA
|
Sum(((fermat(n)-1))/2^(j+1),j=0..n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 24 2006
|
|
MAPLE
|
a:=n->sum(((fermat(n)-1))/2^(j+1), j=0..n): seq(a(n), n=0..8); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 24 2006
|
|
CROSSREFS
|
Cf. A000610.
Sequence in context: A132490 A058388 A081383 this_sequence A133028 A144985 A081397
Adjacent sequences: A001317 A001318 A001319 this_sequence A001321 A001322 A001323
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 23 2000
|
|
|
Search completed in 0.002 seconds
|
