cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Amarnath Murthy, Oct 07 2002

Keywords

Comments

For n=10 the arrangement is 1,2,5,10,3,9,4,8,7,6.

Examples

			Triangle begins:
  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;
  ...
		

Extensions

More terms from David Wasserman, Mar 24 2005
Keyword tabl added by Michel Marcus, Jan 08 2025