|
Search: id:A005610
|
|
|
| A005610 |
|
Number of Boolean functions realized by cascades of n gates.
(Formerly M4936)
|
|
+0
1
|
|
| 2, 14, 86, 518, 3110, 18662, 111974, 671846, 4031078, 24186470, 145118822, 870712934, 5224277606, 31345665638, 188073993830, 1128443962982, 6770663777894, 40623982667366, 243743896004198, 1462463376025190
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
J. T. Butler, ``Fanout-free networks of multivalued gates,'' in Proc. Symposium Multiple-Valued Logic, Charlotte NC, 1977. IEEE Press, NY, 1977, pp. 39-46.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
Index entries for sequences related to Boolean functions
|
|
FORMULA
|
(2/5) * (6*6^n - 1). - R. Stephan, Apr 19 2004
|
|
MAPLE
|
A005610:=-2*(-7+6*z)/(6*z-1)/(z-1); [Conjectured by S. Plouffe in his 1992 dissertation. Gives the sequence apart from the initial 2.]
|
|
CROSSREFS
|
Cf. A003464.
Adjacent sequences: A005607 A005608 A005609 this_sequence A005611 A005612 A005613
Sequence in context: A036692 A075140 A037563 this_sequence A065355 A065892 A139183
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from R. Stephan, Apr 19 2004
|
|
|
Search completed in 0.002 seconds
|
