|
Search: id:A076081
|
|
|
| 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]. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
E.g. for n =10 the arrangement is 1,2,5,10,3,9,4,8,7,6.
|
|
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
|
Sequence in context: A005678 A114905 A126597 this_sequence A107338 A118123 A131756
Adjacent sequences: A076078 A076079 A076080 this_sequence A076082 A076083 A076084
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 07 2002
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), Mar 24 2005
|
|
|
Search completed in 0.002 seconds
|
