A304041 Number of inequivalent solutions to problem in A054961.

1, 1, 1, 1, 1, 2, 2, 3, 2, 1

Offset

0,6

Comments

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

Links

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

Example

List of all inequivalent solutions(in hexadecimal format)
0: {0}
1: {1 0}
2: {2 1 0}
3: {4 2 1 0}
4: {8 4 2 1 0}
5: {10 8 4 2 1 0}
    {12 11 c 6 9 0}
6: {30 a 5 2c 23 19 16 0}
    {2 1 24 18 32 29 e 15}
7: {9 5 3 18 44 22 68 34 52 0}
    {21 22 18 14 a 5 70 49 46 0}
    {40 21 22 18 14 a 5 70 49 46}
8: {c0 30 9 6 a8 92 85 64 51 4a 23 1c 0}
    {2 1 c0 24 18 8c 70 a2 91 4a 45 16 29}
9: {100 21 18 6 1c0 85 43 68 b0 54 8a 115 10b 164 1a2 2d 33}

Crossrefs

Cf. A054961, A054962.

Sequence in context: A127639 A248081 A259632 * A238509 A353932 A368798

Adjacent sequences: A304038 A304039 A304040 * A304042 A304043 A304044

Keyword

nonn,more

Author

Zhao Hui Du, May 06 2018

Status

approved