Link #588 to A006065 and A008997#292
Merged
Merged
Conversation
This was referenced May 14, 2026
Open
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Problem #588 generalizes the classical orchard problem to higher$k$ : $f_k(n)$ = max number of $k$ -rich lines under the constraint that no $k+1$ points are collinear, asking whether $f_k(n) = o(n^2)$ for $k \geq 4$ .
The$k=4$ case is A006065 "Maximal number of 4-tree rows in n-tree orchard problem". The $k=5$ case is A008997 "Orchard problem with 5 trees in a row". Both A006065 and A008997 already cite the related problem #669.
(AI-assisted; OEIS matches are known sequences, not new submissions.)