Problem #506 asks: what is the minimum number of circles determined by any $n$ points in $\mathbb{R}^2$, not all on a circle?
The natural integer sequence is $f(3), f(4), f(5), \ldots$ — the minimum number of distinct circles through 3 of the $n$ points, taken over all configurations where not all points are co-circular.
A search of OEIS did not surface this sequence under "circles through points," "minimum circles," or related terms. It seems worth submitting once enough values are computed.
This problem is parallel in spirit to #89/A186704 (minimum distinct distances) and #669/A003035 (orchard problem). Per the project's no-AI-submissions rule for OEIS, a human-written computation would be needed before submission.
(Filed alongside PRs #292-296 in the same Tier-1 OEIS-linking pass.)
Problem #506 asks: what is the minimum number of circles determined by any$n$ points in $\mathbb{R}^2$ , not all on a circle?
The natural integer sequence is$f(3), f(4), f(5), \ldots$ — the minimum number of distinct circles through 3 of the $n$ points, taken over all configurations where not all points are co-circular.
A search of OEIS did not surface this sequence under "circles through points," "minimum circles," or related terms. It seems worth submitting once enough values are computed.
This problem is parallel in spirit to #89/A186704 (minimum distinct distances) and #669/A003035 (orchard problem). Per the project's no-AI-submissions rule for OEIS, a human-written computation would be needed before submission.
(Filed alongside PRs #292-296 in the same Tier-1 OEIS-linking pass.)