|
|
A357006
|
|
Numbers k that are the smallest of all numbers that are cyclically equivalent to k.
|
|
3
|
|
|
1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 15, 16, 17, 19, 23, 31, 32, 33, 34, 35, 36, 37, 39, 42, 43, 45, 47, 63, 64, 65, 67, 69, 71, 75, 79, 95, 127, 128, 129, 130, 131, 133, 135, 136, 137, 138, 139, 141, 143, 147, 151, 153, 155, 159, 170, 171, 175, 187, 191, 255, 256
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For the definition of cyclic equivalence, see A357005, or Hladnik, Marušič, and Pisanski (2002).
The sequence consists of the fixed points of A357005.
The number of terms k in the interval 2^(m-1) <= k < 2^m equals A002729(m)-1.
|
|
LINKS
|
Milan Hladnik, Dragan Marušič, and Tomaž Pisanski, Cyclic Haar graphs, Discrete Mathematics 244 (2002), 137-152.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|