|
%I #18 May 26 2018 22:43:06
%S 1,1,1,1,1,2,2,3,2,1
%N Number of inequivalent solutions to problem in A054961.
%C If one solution can be transformed into another by reordering the bits, they are considered to be equivalent.
%e List of all inequivalent solutions(in hexadecimal format)
%e 0: {0}
%e 1: {1 0}
%e 2: {2 1 0}
%e 3: {4 2 1 0}
%e 4: {8 4 2 1 0}
%e 5: {10 8 4 2 1 0}
%e {12 11 c 6 9 0}
%e 6: {30 a 5 2c 23 19 16 0}
%e {2 1 24 18 32 29 e 15}
%e 7: {9 5 3 18 44 22 68 34 52 0}
%e {21 22 18 14 a 5 70 49 46 0}
%e {40 21 22 18 14 a 5 70 49 46}
%e 8: {c0 30 9 6 a8 92 85 64 51 4a 23 1c 0}
%e {2 1 c0 24 18 8c 70 a2 91 4a 45 16 29}
%e 9: {100 21 18 6 1c0 85 43 68 b0 54 8a 115 10b 164 1a2 2d 33}
%Y Cf. A054961, A054962.
%K nonn,more
%O 0,6
%A _Zhao Hui Du_, May 06 2018
| 