Least number k such that there are exactly n ways to choose a multiset consisting of a binary index of each binary index of k.
A367913
Least number k such that there are exactly n ways to choose a multiset consisting of a binary index of each binary index of k.
Terms
- a(0) =1a(1) =4a(2) =64a(3) =20a(4) =68a(5) =320a(6) =52a(7) =84a(8) =16448a(9) =324a(10) =832a(11) =116a(12) =1104a(13) =308a(14) =816a(15) =340a(16) =836a(17) =848a(18) =1108a(19) =1136a(20) =1360a(21) =3152a(22) =16708a(23) =372a(24) =5188a(25) =5216a(26) =852a(27) =880a(28) =2884a(29) =1364
External references
- oeis: A367913