Triangle T(n,k) = number of Boolean functions mapping {0,1}^n to {0,1}^n with image of size k (k = 0...2^n) under action of GL(n,2).
A053874
Triangle T(n,k) = number of Boolean functions mapping {0,1}^n to {0,1}^n with image of size k (k = 0...2^n) under action of GL(n,2).
Terms
- a(0) =1a(1) =2a(2) =1a(3) =1a(4) =2a(5) =2a(6) =2a(7) =1a(8) =1a(9) =2a(10) =2a(11) =3a(12) =4a(13) =3a(14) =2a(15) =2a(16) =1a(17) =1a(18) =2a(19) =2a(20) =3a(21) =5a(22) =7a(23) =9a(24) =11a(25) =12a(26) =11a(27) =9a(28) =7a(29) =5
External references
- oeis: A053874