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.

Previous Showing 11-14 of 14 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

N. J. A. Sloane

Keywords

References

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

Links

Crossrefs

Cf. A005617, A005740.

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

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

Original entry on oeis.org

2, 4, 14, 104, 1498, 32876, 950054, 33801424, 1426158002, 69573363284, 3851708875582, 238539414903224, 16338422029336970, 1226232142235080636, 100069553388048443990, 8822157207387535459616, 835558086134404986368866, 84609374709488540680125092
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

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

Crossrefs

Cf. A005615, A005742.

Formula

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

Extensions

a(7) corrected and more terms from Sean A. Irvine, Jul 21 2016
a(0)=2 prepended and name clarified by Andrew Howroyd, 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

N. J. A. Sloane

Keywords

References

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

Links

Crossrefs

Cf. A005617, A005741.

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

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

Original entry on oeis.org

2, 6, 32, 346, 6572, 176678, 6009040, 245551538, 11694413396, 635421164350, 38766848465336, 2622886302957962, 194847034853726140, 15763561489400425046, 1379408529039591621920, 129804134856816471241570, 13069901171127981930379940
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

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

Crossrefs

Cf. A005615, A005743.

Formula

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

Extensions

a(7) corrected and more terms from Sean A. Irvine, Jul 21 2016
Previous Showing 11-14 of 14 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.