|
Search: id:A039754
|
|
|
| A039754 |
|
Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values under action of Jevons group. |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 3, 6, 3, 3, 1, 1, 1, 1, 4, 6, 19, 27, 50, 56, 74, 56, 50, 27, 19, 6, 4, 1, 1, 1, 1, 5, 10, 47, 131, 472, 1326, 3779, 9013, 19963, 38073, 65664, 98804, 133576, 158658, 169112
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
T(n,k) = number of classes of nonlinear (or linear) binary codes of length n containing k codewords (n>=1, 0 <= k <= 2^n). - Diego Torres (torresvillarroel(AT)hotmail.com), Aug 31 2002
|
|
REFERENCES
|
Jacob Feldman, A catalog of Boolean concepts, Journal of Mathematical Psychology, Volume 47, Issue 1, 2003, 75-89.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 112.
M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 150.
|
|
LINKS
|
Harald Fripertinger, Enumeration of block codes
Index entries for sequences related to Boolean functions
|
|
FORMULA
|
Reference gives g.f.
Fripertinger gives g.f. for the number of classes of (n, m) nonlinear codes over an alphabet of size A.
|
|
EXAMPLE
|
1, 1, 1; 1, 1, 2, 1, 1; 1, 1, 3, 3, 6, 3, 1, 1; ...
|
|
CROSSREFS
|
Row sums give A000616. Cf. A052265.
Sequence in context: A046213 A129179 A120621 this_sequence A062277 A118210 A061399
Adjacent sequences: A039751 A039752 A039753 this_sequence A039755 A039756 A039757
|
|
KEYWORD
|
nonn,tabf,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 20 2000
|
|
|
Search completed in 0.002 seconds
|
