|
%I #22 Oct 31 2021 22:57:13
%S 0,0,1,0,3,0,0,7,0,7,0,15,0,105,750
%N T(n,k) = number of small equivalence classes of half full n-ary Boolean functions that contain 2^k functions.
%C Like A227725, but counting only small equivalence classes (sec) of half full Boolean functions, i.e. those with an equal number of zeros and ones.
%H Tilman Piesk, <a href="http://en.wikiversity.org/wiki/3-ary_Boolean_functions;_half_full_secs">Example for row 3</a>
%H Tilman Piesk, <a href="http://en.wikiversity.org/wiki/Equivalence_classes_of_Boolean_functions#sec">Small equivalence classes of Boolean functions</a>
%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%e Triangle begins: Row sums (central numbers of A054724)
%e 0 0
%e 0 1 1
%e 0 3 0 3
%e 0 7 0 7 14
%e 0 15 0 105 750 870
%Y Cf. A227725, A054724, A000225.
%K nonn,tabl,more
%O 0,5
%A _Tilman Piesk_, Jul 22 2013
|
