The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227725 T(n,k) = number of small equivalence classes of n-ary Boolean functions that contain 2^k functions. 1
 2, 2, 1, 2, 3, 2, 2, 7, 14, 23, 2, 15, 70, 345, 3904 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Left diagonal (k=0) has only 2s. Two functions (contradiction and tautology) are always alone in their respective sec, regardless of arity. Second diagonal (k=1) is 2^n-1 (A000225). These are the n-ary linear Boolean functions. Each sec contains a row of a binary Walsh matrix and its complement. Right diagonal (k=n) is A051502, the numbers of small equivalence classes of n-ary functions, that contain the highest possible number of 2^n functions. Triangle begins:              Row sums (A000231)             2                         2          2     1                      3       2     3     2                   7    2     7    14    23               46 2    15    70    345   3904        4336 LINKS Tilman Piesk, Small equivalence classes of Boolean functions CROSSREFS A000231, A051502, A000225, A227722. Sequence in context: A260414 A160735 A216338 * A331244 A316845 A120481 Adjacent sequences:  A227722 A227723 A227724 * A227726 A227727 A227728 KEYWORD nonn,tabl,more AUTHOR Tilman Piesk, Jul 22 2013 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 January 22 10:25 EST 2020. Contains 331144 sequences. (Running on oeis4.)