Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000133
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000133 Number of Boolean functions of n variables.
(Formerly M1547 N0604)
+0
3
2, 5, 30, 2288, 67172352, 144115192303714304, 1329227995784915891206435945914040320, 226156424291633194186662080095093570364871077725232774230036394136943198208 (list; graph; listen)
OFFSET

1,1

REFERENCES

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

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.

M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 153.

LINKS

Index entries for sequences related to Boolean functions

FORMULA

a(n)=(2^(2^n)+(2^n-1)*2^(2^(n-1)+1))/2^(n+1). [From Sean A. Irvine (sairvin(AT)xtra.co.nz), Sep 27 2009]

CROSSREFS

Sequence in context: A140786 A129951 A127298 this_sequence A059086 A107389 A077483

Adjacent sequences: A000130 A000131 A000132 this_sequence A000134 A000135 A000136

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 23 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research