Number of distinct subsets S of [n] such that for all 1 <= k <= n, there exist elements x,y in S (not necessarily distinct) such that x*y = 2k.

A384330

Number of distinct subsets S of [n] such that for all 1 <= k <= n, there exist elements x,y in S (not necessarily distinct) such that x*y = 2k.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =1a(5) =1a(6) =3a(7) =3a(8) =8a(9) =11a(10) =30a(11) =30a(12) =57a(13) =57a(14) =159a(15) =295a(16) =427a(17) =427a(18) =1033a(19) =1033a(20) =1973a(21) =3610a(22) =10427a(23) =10427a(24) =20575a(25) =28731a(26) =83535a(27) =142793a(28) =273755a(29) =273755

External references