login
A350418
a(n) is the number of universal binary n-state logic gates.
0
1, 2, 3774, 942897552, 76897278357005640
OFFSET
1,2
COMMENTS
The number of closed binary operations F on a set of order n such that {F} is functionally complete.
a(3) computed by Craig Gidney, corrected by Code Golf Stack Exchange user AnttiP.
a(4) computed by Code Golf Stack Exchange user AnttiP.
a(5) computed by Code Golf Stack Exchange user gsitcia.
LINKS
R. O. Davies, On n-Valued Sheffer Functions, Mathematical Logic Quarterly, 25 (1979), 293-298.
Woosuk Kwak, Counting universal n-ary logic gates, Code Golf Stack Exchange.
Wikipedia, Logic gate.
FORMULA
Limit_{n->oo} a(n)/A002489(n) = 1/e.
EXAMPLE
For n = 2, the two universal logic gates are NAND and NOR.
CROSSREFS
A002489(n) counts all binary n-state logic gates.
Sequence in context: A065671 A094211 A372116 * A114573 A285086 A367436
KEYWORD
nonn,hard,more
AUTHOR
Woosuk Kwak, Dec 29 2021
EXTENSIONS
a(5) added by Woosuk Kwak, Nov 23 2023
STATUS
approved