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-3 of 3 results.

A005616 Number of non-degenerate disjunctively-realizable functions of n variables.

Original entry on oeis.org

2, 2, 10, 114, 2154, 56946, 1935210, 80371122, 3944568042, 223374129138, 14335569726570, 1028242536825906, 81514988432370666, 7077578056972377714, 667946328512863533930, 68080118128074301929138, 7453010693997492901047018
Offset: 0

Views

Author

Keywords

Comments

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

References

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

Crossrefs

Programs

  • PARI
    seq(n)=my(p=2*exp(x + O(x*x^n)), g=serreverse(x + log(p-1) - p + 2)); Vec(serlaplace(2*exp(g))) \\ Andrew Howroyd, Apr 03 2025
    
  • PARI
    seq(n)=Vec(2*serlaplace(1 + serreverse(log(1 + 3*x + 2*x^2 + O(x*x^n)) - 2*x))) \\ Andrew Howroyd, Apr 03 2025

Formula

From Andrew Howroyd, Apr 03 2025: (Start)
E.g.f.: 2*(p + q + 1) where p,q satisfy q = exp(p) - p - 1, p = exp(2*q + p + x) - (2*q + p + 1).
E.g.f.: 2*exp( Series_Reversion(x + log(2*exp(x)-1) - 2*(exp(x) - 1)) ).
E.g.f.: 2 + 2*Series_Reversion(log(1 + 3*x + 2*x^2) - 2*x). (End)

Extensions

a(0), a(14)-a(16) from Sean A. Irvine, Jul 21 2016

A005739 Number of disjunctively-realizable functions of n variables.

Original entry on oeis.org

2, 4, 16, 152, 2680, 68968, 2311640, 95193064, 4645069336, 261938616104, 16756882325464, 1198897678224232, 94851206834082200, 8221740727881348520, 774839374768829174104, 78880995816162599086568, 8626562553228821851608856
Offset: 0

Views

Author

Keywords

Comments

Number of fanout-free Boolean functions of n variables using And, Or, Xor, and Not gates. - Andrew Howroyd, Apr 03 2025

References

  • K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, C-27 (1978), 309-318.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Formula

a(n) = A005616(n) + A005738(n) [From Kodandapani and Seth]. - Sean A. Irvine, Jul 21 2016
Binomial transform of A005616. - Andrew Howroyd, Apr 03 2025

Extensions

More terms from Sean A. Irvine, Jul 21 2016
a(0)=2 prepended by Andrew Howroyd, Apr 03 2025

A005749 Cascade-realizable Boolean functions of n variables.

Original entry on oeis.org

4, 16, 152, 2368, 47688, 1156000, 32699080, 1057082752, 38444581640, 1553526946144, 69054999618888, 3348574955346496, 175908582307762312, 9951733002164182048, 603217074746723736776, 39001136297834245139200, 2679228986900726147063304
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

Cf. A005613.

Formula

a(n) = Sum_{k=0..n} binomial(n, k) * A005613(k). - Sean A. Irvine, Aug 22 2016

Extensions

More terms from Sean A. Irvine, Aug 22 2016
Showing 1-3 of 3 results.