A051486 Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.

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, 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, 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

Offset: 0

Author

Vladeta Jovovic

Keywords

• nonn
• tabf
• nice

Examples

			[1, 1], [1, 2, 1], [1, 2, 2, 2, 1], [1, 2, 1, 2, 4, 2, 1, 2, 1], ...
		

Links

• Index entries for sequences related to Boolean functions

Crossrefs

Row sums give A011782.