|
|
A054346
|
|
Number of inequivalent sublattices of index n in square lattice, where two sublattices are considered equivalent if one can be rotated or reflected to give the other.
|
|
7
|
|
|
1, 1, 2, 2, 4, 3, 5, 3, 7, 5, 7, 4, 11, 5, 8, 8, 12, 6, 13, 6, 15, 10, 11, 7, 21, 9, 13, 12, 18, 9, 21, 9, 21, 14, 16, 13, 29, 11, 17, 16, 28, 12, 28, 12, 25, 21, 20, 13, 39, 16, 24, 20, 29, 15, 34, 18, 36, 22, 25, 16, 47, 17, 26, 29, 38, 21, 40, 18, 36, 26, 36, 19, 58, 20
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
If we count sublattices as equivalent only if they are related by a rotation, we get A054345 instead of this sequence. If we only allow rotations and reflections that preserve the parent (square) lattice, we get A145393; the first discrepancy is at n = 25 (see illustration), the second is at n = 30. If both restrictions are applied, i.e., only rotations preserving the parent lattice are allowed, we get A145392. The analog for the hexagonal lattice is A300651. - Andrey Zabolotskiy, Mar 12 2018
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 1, 2, 3, 4 the sublattices are generated by the rows of:
[1 0] [2 0] [2 0] [3 0] [3 0] [4 0] [4 0] [2 0] [2 0]
[0 1] [0 1] [1 1] [0 1] [1 1] [0 1] [1 1] [0 2] [1 2].
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|