login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I #6 Dec 05 2013 19:55:46

%S 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,

%T 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,

%U 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

%N 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].

%C E.g. for n =10 the arrangement is 1,2,5,10,3,9,4,8,7,6.

%e 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,...

%K nonn

%O 1,3

%A _Amarnath Murthy_, Oct 07 2002

%E More terms from _David Wasserman_, Mar 24 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)