This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000157 Number of Boolean functions of n variables. (Formerly M1818 N0721) 2
 1, 2, 7, 111, 308063, 100126976263592, 131867858014413288241233435594064, 2804519150441879896741320496043335469582478995067528608051651559815168 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 153 (divided by 2). M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561. 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). LINKS Sean A. Irvine, Table of n, a(n) for n = 1..11 (shortened by N. J. A. Sloane, Jan 13 2019) FORMULA a(n) = A000370(n)/2. - Sean A. Irvine, Feb 14 2012 CROSSREFS Cf. A000370. Sequence in context: A072664 A045310 A224445 * A264999 A326940 A326964 Adjacent sequences:  A000154 A000155 A000156 * A000158 A000159 A000160 KEYWORD nonn AUTHOR EXTENSIONS More terms from Sean A. Irvine, Feb 13 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 17:36 EST 2019. Contains 329865 sequences. (Running on oeis4.)