Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.
A368184
Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.
Terms
- a(0) =7a(1) =1a(2) =4a(3) =20a(4) =276a(5) =320a(6) =1088a(7) =65856a(8) =66112a(9) =66624a(10) =263232
External references
- oeis: A368184