I have indexed the unit cells of the Kagome lattice. Each unit cells consists of atoms $(A,B,C)$. In this cell there are $21 \times 3$ sites.
From this picture above I see a pattern is emerging when I look at the indices of the unit cells that are connected such as
list1 = {{1}, {2, 3}, {4, 5, 6}, {7, 8, 9, 10}, {11, 12, 13, 14,
15}, {16, 17, 18, 19, 20, 21}}; (*connecting bases with C -> B*)
list2 = {{1, 2, 4, 7, 11, 16}, {3, 5, 8, 12, 17}, {6, 9, 13, 18}, {10,
14, 19}, {15, 20}, {21}}; (*Connecting left edges with B -> A*)
list3 = {{1, 3, 6, 10, 15, 21}, {2, 5, 9, 14, 20}, {4, 8, 13, 19}, {7,
12, 18}, {11, 17}, {16}}; (*Connecting right edges with C -> A*)
I have a feeling that if I start from a table Table[i,{i,1,21*3}]
by performing some kind of partitioning I can achieve three of these lists.
For this small system, I can write the indices, but for larger systems, it is
very unlikely to have all of these lists correct. So I am trying to see the pattern to generate these list for arbitrarily large systems of $L \times 3$
sites (L is the number of total of $\bigtriangleup$ triangles)
list1 = FoldPairList[TakeDrop, Range[21], Range[6]]
. Have you looked these sequences up at OEIS to see if there might already be an analytical expression / algorithm to generate them? $\endgroup$