|
%I #8 Jun 13 2013 14:31:35
%S 1,1,1,2,1,1,2,2,2,1,1,2,1,2,4,2,1,2,1,1,2,1,0,2,4,3,2,2,2,3,4,2,0,1,
%T 2,1,1,2,1,0,0,2,4,2,0,0,3,6,3,0,0,4,8,4,0,0,3,6,3,0,0,2,4,2,0,0,1,2,
%U 1,1,2,1,0,0,0,2,4,2,0,0,0,1,2,1,2,4,2,0,0,1,6,9,4,0,0,2,6,6,2
%N Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.
%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%e [1, 1], [1, 2, 1], [1, 2, 2, 2, 1], [1, 2, 1, 2, 4, 2, 1, 2, 1], ...
%Y Row sums give A011782.
%K nonn,tabf,nice
%O 0,4
%A _Vladeta Jovovic_
|
