|
%I #10 May 26 2018 22:42:07
%S 1,1,1,1,1,1,1,2,4,1,5,2
%N Number of inequivalent solutions to problem discussed in A286874.
%C If one solution can be transformed to another by reordering the bits, they are considered to be equivalent.
%e List of inequivalent solutions (in hexadecimal format):
%e 0: {0}
%e 1: {0 1}
%e 2: {1 2}
%e 3: {1 2 4}
%e 4: {1 2 4 8}
%e 5: {1 2 4 8 10}
%e 6: {1 2 4 8 10 20}
%e 7: {1 2 4 8 10 20 40}
%e {70 4a 45 2c 23 19 16}
%e 8: {1 2 4 8 10 20 40 80}
%e {80 70 4a 45 2c 23 19 16}
%e {c0 2a 25 1c 13 70 49 46}
%e {b0 89 86 64 51 4a 23 1c}
%e 9: {1c0 130 109 106 a8 92 85 64 51 4a 23 1c}
%e 10: {200 1c0 130 109 106 a8 92 85 64 51 4a 23 1c}
%e {300 a8 94 83 62 51 4c 25 1a 1c0 130 109 106}
%e {224 209 212 38 122 8c 51 105 46 83 148 190 e0}
%e {230 209 206 8a 45 103 128 114 58 a4 91 62 3c0}
%e {230 20a 205 121 a2 64 118 91 52 49 8c 106 1c0}
%e 11: {25 1a 43 450 160 244 c8 428 230 94 10c 406 111 209 a2 481 302}
%e {51 25 b 444 422 418 e0 92 8c 242 148 130 228 106 214 481 301}
%Y Cf. A286874.
%K nonn,more
%O 0,8
%A _Zhao Hui Du_, May 03 2018
| 