In (1,1), the a values all contain the factors of every odd number that is the sum of two squares. This was a VQC crumb. This is true because numbers that are odd and the sum of two squares (i.e. the a values in (1,1)) can only be divided by other numbers that are odd and the sum of two squares. Also, VQC didn't mention it, but Saga figured out that all of the values of a in (1,1) aren't just the sum of two squares, but they're also actually the sum of consecutive squares. (1,1)'s a values miss a few odd sums of squares (e.g. 17). These numbers still turn up as the factors of other odd sums of squares. These numbers turn up as factors of other numbers in the sequence in a pattern. Where they turn up, they will turn up again however big they are in steps again (i.e. 5 turns up 5 away from the first time 5 appears, and then 5 away from that, and 5 away from that, etc). They will also each turn up once between each of these times, the same distance away each time (again with 5, it turns up 2 away from the origin, then 2 away from the next origin (i.e. 5 away from the actual origin), and so on). It's a different inner gap for the other numbers, but they all only seem to have one, and they all fit the first mentioned pattern. Note that this is for the values of a in (1,1), not for the sequence of odd numbers that are the sum of two squares. So I guess that makes it a fractal, right?