Least k such that there are exactly A003586(n) ways to choose a binary index of each binary index of k.

A368111

Least k such that there are exactly A003586(n) ways to choose a binary index of each binary index of k.

Terms

    a(0) =1a(1) =4a(2) =64a(3) =20a(4) =68a(5) =52a(6) =1088a(7) =84a(8) =308a(9) =1092a(10) =116a(11) =5184a(12) =820a(13) =1108a(14) =372a(15) =5188a(16) =2868a(17) =1140a(18) =13376a(19) =884a(20) =5204a(21) =17204a(22) =1396a(23) =13380a(24) =2932a(25) =5236a(26) =275520a(27) =19252a(28) =1908a(29) =13396

External references