login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005743 Number of fanout-free Boolean functions of n variables.
(Formerly M3491)
0
4, 14, 104, 1498, 32876, 950054, 33801424, 1426158002, 69573363284, 3851708875582, 238539414903224, 16338422029336970, 1226232142235080636, 100069553388048443990, 8822157207387535459616, 835558086134404986368866, 84609374709488540680125092 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Kodandapani and Seth give incorrect a(7) = 33304122 (a consequence of former incorrect A005742(7)).
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)
FORMULA
a(n) = A005615(n) + A005742(n). - Sean A. Irvine, Jul 21 2016
CROSSREFS
Sequence in context: A209322 A110302 A282617 * A343962 A283793 A048369
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(7) corrected and more terms from Sean A. Irvine, Jul 21 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)