login
A051486
Triangle T(n,k) = number of symmetric Boolean functions of n variables and rank from 0 to 2^n.
1
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,4
EXAMPLE
[1, 1], [1, 2, 1], [1, 2, 2, 2, 1], [1, 2, 1, 2, 4, 2, 1, 2, 1], ...
CROSSREFS
Row sums give A011782.
Sequence in context: A341694 A255337 A026465 * A218541 A213911 A081355
KEYWORD
nonn,tabf,nice
STATUS
approved