A303977 Number of inequivalent solutions to problem discussed in A286874.

1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 5, 2

Offset

0,8

Comments

If one solution can be transformed to another by reordering the bits, they are considered to be equivalent.

Links

Table of n, a(n) for n=0..11.

Example

List of inequivalent solutions (in hexadecimal format):
0: {0}
1: {0 1}
2: {1 2}
3: {1 2 4}
4: {1 2 4 8}
5: {1 2 4 8 10}
6: {1 2 4 8 10 20}
7: {1 2 4 8 10 20 40}
      {70 4a 45 2c 23 19 16}
8: {1 2 4 8 10 20 40 80}
     {80 70 4a 45 2c 23 19 16}
     {c0 2a 25 1c 13 70 49 46}
     {b0 89 86 64 51 4a 23 1c}
9: {1c0 130 109 106 a8 92 85 64 51 4a 23 1c}
10: {200 1c0 130 109 106 a8 92 85 64 51 4a 23 1c}
       {300 a8 94 83 62 51 4c 25 1a 1c0 130 109 106}
      {224 209 212 38 122 8c 51 105 46 83 148 190 e0}
      {230 209 206 8a 45 103 128 114 58 a4 91 62 3c0}
      {230 20a 205 121 a2 64 118 91 52 49 8c 106 1c0}
11: {25 1a 43 450 160 244 c8 428 230 94 10c 406 111 209 a2 481 302}
       {51 25 b 444 422 418 e0 92 8c 242 148 130 228 106 214 481 301}

Crossrefs

Cf. A286874.

Sequence in context: A004597 A077623 A132042 * A060370 A318704 A165064

Adjacent sequences: A303974 A303975 A303976 * A303978 A303979 A303980

Keyword

nonn,more

Author

Zhao Hui Du, May 03 2018

Status

approved