OEIS A002773 · simple matroids (combinatorial geometries) on n points
A simple matroid is a set of points together with a decision, for every subset, about how many dimensions it spans: which triples are collinear, which quadruples coplanar, and so on. The choices only have to obey the rules that real points obey (two points determine a line, two planes in a 3D space meet in a line, …), so not every one can be drawn with straight lines. Counting them up to relabeling gives 1, 1, 1, 2, 4, 9, 26, 101, 950, 376467 for n = 0, …, 9, and now 3231997106202 for n = 10 (new, derived here).
Every matroid up to 8 points is in the gallery, and about 600 of the 376467 on 9 points (random samples of ranks 3 to 6 and all of ranks 7 to 9), from Mayhew and Royle's catalogue. Hover or tap one to mark the matroids it shrinks to by deleting a point, and the ones it grows into.