|
Search: id:A109468
|
|
|
| A109468 |
|
a(n) is the number of permutations of (1,2,3,...,n) written in binary such that no adjacent elements share a common 1-bit. |
|
+0
1
|
|
| 1, 2, 0, 4, 2, 0, 0, 0, 8, 32, 0, 8, 0, 0, 0, 0, 0, 64, 0, 1968, 508, 0, 0, 0, 16
(list; graph; listen)
|
|
|
Search completed in 0.001 seconds
|
