cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A005741 Number of fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.

Original entry on oeis.org

2, 4, 16, 160, 3112, 89488, 3358600, 154925968, 8469271816, 535078978000, 38352590740744, 3074533743260944, 272548937753080072, 26471366143068858448, 2795374966070961592072, 318874907420330435803024, 39075835592493074367768328
Offset: 0

Views

Author

Keywords

References

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

Crossrefs

Formula

a(n) = A005617(n) + A005740(n). - Sean A. Irvine, Jul 21 2016
Binomial transform of A005617. - Andrew Howroyd, Mar 29 2025

Extensions

More terms from Sean A. Irvine, Jul 21 2016
a(0)=2 prepended and name clarified by Andrew Howroyd, Mar 29 2025
a(16) from Alois P. Heinz, Mar 29 2025

A005740 Number of degenerate fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.

Original entry on oeis.org

2, 6, 38, 558, 14102, 493230, 21734582, 1150168974, 70917337622, 4987580274414, 393796969969526, 34476778683241806, 3313919458048503254, 346878958323336066222, 39271056622439364321590, 4780894577220073271485710
Offset: 1

Views

Author

Keywords

References

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

Crossrefs

Formula

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

Extensions

More terms from Sean A. Irvine, Jul 21 2016
Showing 1-2 of 2 results.