|
| |
|
|
A005609
|
|
Number of Boolean functions realized by cascades of n gates.
(Formerly M5333)
|
|
1
| |
|
|
64, 1744, 48784, 1365904, 38245264, 1070867344, 29984285584, 839559996304, 23507679896464, 658215037100944, 18430021038826384, 516040589087138704, 14449136494439883664, 404575821844316742544, 11328123011640868791184
(list; graph; refs; listen; history; internal format)
|
|
|
|
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
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
| G.f.: (64 - 112 x ) / (1 - x ) ( 1 - 28 x ).
a(1)=64, a(2)=1744, a(n)=29*a(n-1)-28*a(n-2) [From Harvey P. Dale, Nov 19 2011]
|
|
|
MAPLE
| A005609:=-16*(-4+7*z)/(28*z-1)/(z-1); [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
|
MATHEMATICA
| CoefficientList[Series[(64-112 x)/((1-x) (1-28 x)), {x, 0, 30}], x] (* or *) LinearRecurrence[{29, -28}, {64, 1744}, 30] (* From Harvey P. Dale, Nov 19 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A194496 A195807 A017115 * A065788 A203539 A116133
Adjacent sequences: A005606 A005607 A005608 * A005610 A005611 A005612
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
