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.

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