|
Search: id:A058241
|
|
|
| A058241 |
|
For i=1 to n, c(i) is a positive integer such that c(x) != c(y) if x != y; place each c(i) on the circumference of a circle at regular intervals. The arrangement must be such that any sum of adjacent c(i)'s is unique (these sums range from 1 to n(n-1)+1); a(n) = number of ways to choose the c(i). |
|
+0
1
|
|
| 1, 1, 1, 2, 1, 5, 0, 6, 4, 6, 0, 18, 0, 20, 0, 0, 6, 51, 0, 42
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
