Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000652
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000652 Invertible Boolean functions of n variables.
(Formerly M4315 N1807)
+0
3
1, 1, 6, 924, 81738720000, 256963707943061374889193111552000, 30978254928194376001814792318154658399138184007229852126545533479881553257431040\ 000000 (list; graph; listen)
OFFSET

0,3

COMMENT

Equivalence classes of invertible maps from {0,1}^n to {0,1}^n, under action of (C_2)^n on both domain and range.

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, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 154, problem 12.

C. S. Lorens, Invertible Boolean functions, IEEE Trans. Electron. Computers, EC-13 (1964), 529-541.

LINKS

Index entries for sequences related to Boolean functions

FORMULA

A000652: n->2^(-2*n)*( (2^n)! + (2^n-1)^2 * ( (2^(n-1))! )*2^(2^(n-1)));

CROSSREFS

Cf. A001038 A000653 A000654 A000722 A001537 A046856 A046857

Sequence in context: A064430 A137801 A076667 this_sequence A145250 A024085 A080474

Adjacent sequences: A000649 A000650 A000651 this_sequence A000653 A000654 A000655

KEYWORD

nonn,easy

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research