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.

A279650 An idempotent self-orthogonal Latin square of order 11, read by rows.

Original entry on oeis.org

1, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 3, 2, 1, 11, 10, 9, 8, 7, 6, 5, 4, 5, 4, 3, 2, 1, 11, 10, 9, 8, 7, 6, 7, 6, 5, 4, 3, 2, 1, 11, 10, 9, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 11, 10, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 2, 1, 11, 10, 9, 8, 7, 6, 5, 4, 3, 4, 3, 2, 1, 11, 10, 9, 8, 7, 6, 5, 6, 5, 4, 3, 2, 1, 11, 10, 9, 8, 7, 8, 7, 6, 5, 4, 3, 2, 1, 11, 10, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 11
Offset: 1

Views

Author

Colin Barker, Dec 16 2016

Keywords

Comments

An m X m Latin square consists of m sets of the numbers 1 to m arranged in such a way that no row or column contains the same number twice.
Two m X m Latin squares are orthogonal if no pair of corresponding elements occurs more than once.
A self-orthogonal Latin square is a Latin square that is orthogonal to its transpose.
An m X m self-orthogonal Latin square is idempotent if the diagonal contains 1 to m in order.

Examples

			The Latin square is:
   1 11 10  9  8  7  6  5  4  3  2
   3  2  1 11 10  9  8  7  6  5  4
   5  4  3  2  1 11 10  9  8  7  6
   7  6  5  4  3  2  1 11 10  9  8
   9  8  7  6  5  4  3  2  1 11 10
  11 10  9  8  7  6  5  4  3  2  1
   2  1 11 10  9  8  7  6  5  4  3
   4  3  2  1 11 10  9  8  7  6  5
   6  5  4  3  2  1 11 10  9  8  7
   8  7  6  5  4  3  2  1 11 10  9
  10  9  8  7  6  5  4  3  2  1 11
		

Crossrefs