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.

A000231 Number of inequivalent Boolean functions of n variables under action of complementing group.

Original entry on oeis.org

2, 3, 7, 46, 4336, 134281216, 288230380379570176, 2658455991569831764110243006194384896, 452312848583266388373324160190187140390789016525312000869601987902398529536
Offset: 0

Views

Author

Keywords

Comments

The next term has 152 digits. - Harvey P. Dale, Jun 21 2011

References

  • M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 143.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (Includes this sequence, correctly, although in the Preface on page viii 4336 is mis-typed as 4436).

Crossrefs

Cf. A051502.
Row sums of A054724.

Programs

  • Maple
    a:= n-> (2^(2^n)+(2^n-1)*2^(2^(n-1)))/2^n:
    seq(a(n), n=0..8);  # Alois P. Heinz, Jan 27 2023
  • Mathematica
    Table[(2^(2^n)+(2^n-1)*2^(2^(n-1)))/2^n,{n,10}] (* Harvey P. Dale, Jun 21 2011 *)
  • PARI
    a(n)=(2^(2^n-n)+(2^n-1)*2^(2^(n-1)-n)) \\ Charles R Greathouse IV, Jul 29 2016

Formula

a(n) = (2^(2^n)+(2^n-1)*2^(2^(n-1)))/2^n.

Extensions

More terms from Vladeta Jovovic, Apr 20 2000
a(0)=2 prepended by Alois P. Heinz, Jan 27 2023