login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005742 Number of degenerate fanout-free Boolean functions of n variables.
(Formerly M1698)
1
2, 6, 32, 346, 6572, 176678, 6009040, 245551538, 11694413396, 635421164350, 38766848465336, 2622886302957962, 194847034853726140, 15763561489400425046, 1379408529039591621920, 129804134856816471241570, 13069901171127981930379940 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Kodandapani and Seth paper gives incorrect a(7) = 5511738.

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..17.

K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318.

Index entries for sequences related to Boolean functions

FORMULA

a(n) = Sum_{k=0..n-1} binomial(n, k) * A005615(k). - Sean A. Irvine, Jul 21 2016

CROSSREFS

Sequence in context: A123903 A172401 A272661 * A055612 A236691 A056642

Adjacent sequences:  A005739 A005740 A005741 * A005743 A005744 A005745

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 20:44 EST 2016. Contains 278950 sequences.