This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 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 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) = 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 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 23:44 EST 2019. Contains 329945 sequences. (Running on oeis4.)