Least number k such that there are exactly n ways to choose a different binary index of each binary index of k.

A367910

Least number k such that there are exactly n ways to choose a different binary index of each binary index of k.

Terms

    a(0) =7a(1) =1a(2) =4a(3) =20a(4) =68a(5) =320a(6) =352a(7) =1088a(8) =3136a(9) =13376a(10) =16704a(11) =5184a(12) =82240a(13) =70720a(14) =17472

External references