|
|
A076081
|
|
Rearrange numbers from 1 to n: start with the divisors of n in ascending order followed by numbers in ascending order which leave a remainder 1 on dividing by n, followed by those leaving remainder 2 ... up to remainder [(n-1)/2].
|
|
1
|
|
|
1, 1, 2, 1, 3, 2, 1, 2, 4, 3, 1, 5, 2, 4, 3, 1, 2, 3, 6, 5, 4, 1, 7, 2, 3, 6, 5, 4, 1, 2, 4, 8, 7, 3, 6, 5, 1, 3, 9, 2, 4, 8, 7, 6, 5, 1, 2, 5, 10, 3, 9, 4, 8, 7, 6, 1, 11, 2, 5, 10, 3, 9, 4, 8, 7, 6, 1, 2, 3, 4, 6, 12, 11, 5, 10, 9, 8, 7, 1, 13, 2, 3, 4, 6, 12, 11, 5, 10, 9, 8, 7, 1, 2, 7, 14, 13, 3, 4, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
E.g. for n =10 the arrangement is 1,2,5,10,3,9,4,8,7,6.
|
|
LINKS
|
|
|
EXAMPLE
|
1; 1,2; 1,3,2; 1,2,4,3; 1,5,2,4,3; 1,2,3,6,5,4; 1,7,2,3,6,5; 1,2,4,8,7,3,6,...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|