login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A005610
Number of Boolean functions realized by cascades of n gates.
(Formerly M4936)
3
2, 14, 86, 518, 3110, 18662, 111974, 671846, 4031078, 24186470, 145118822, 870712934, 5224277606, 31345665638, 188073993830, 1128443962982, 6770663777894, 40623982667366, 243743896004198, 1462463376025190
OFFSET
1,1
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
J. T. Butler, Fanout-free networks of multivalued gates, Proc. Internat. Symposium Multiple-Valued Logic, Charlotte, NC, 1977, IEEE Press, NY (1977), 39-46. (Annotated scanned copy)
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
FORMULA
a(n) = (2/5)*(6*6^(n-1) - 1). - Ralf Stephan, Apr 19 2004
a(n) = 6*a(n-1) + 2 for n > 1. - Georg Fischer, Nov 13 2018
MAPLE
A005610:=-2*(-7+6*z)/(6*z-1)/(z-1); # conjectured by Simon Plouffe in his 1992 dissertation; gives the sequence apart from the initial 2
MATHEMATICA
Table[(2/5) (6 6^(n - 1) - 1), {n, 1, 30}] (* Bruno Berselli, Nov 13 2018 *)
CROSSREFS
Cf. A003464.
Sequence in context: A036692 A075140 A037563 * A065355 A162478 A348615
KEYWORD
nonn,easy
EXTENSIONS
More terms from Ralf Stephan, Apr 19 2004
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy