Compact packings of the plane with three sizes of discs: https://arxiv.org/abs/1810.02231, Thomas Fernique, Amir Hashemi, and Olga Sizova
Here, "compact packing" means interior-disjoint disks forming only 3-sided gaps. The circle packing theorem constructs these for any finite maximal planar graph, with little control over disk size. Instead this paper seeks packings of the whole plane by infinitely many disks, with few sizes. 9 pairs of sizes and 164 triples work. Here's one from Fig.3 of the paper.
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.