Link problem 449 to OEIS A399440 - #397
Open
hbakkaoui-hash wants to merge 1 commit into
Open
Conversation
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
hbakkaoui-hash
force-pushed
the
link-449-oeis
branch
from
September 6, 2026 21:36
a255031 to
ca4a5b6
Compare
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
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 449 concerns the function r(n) = the number of pairs of divisors d < e < 2*d of n. This sequence is now in the OEIS as A399440 (https://oeis.org/A399440), which I submitted and which was published on 2026-09-03 (editor: Andrew Howroyd). This PR sets the
oeisfield for problem 449 to A399440, replacing the "possible" placeholder — the same change as PR #333 did for problem 448 / A397433.A Lean formalisation of problem 449 is under review at google-deepmind/formal-conjectures#5210; the
formalizedfield can be updated once it is merged.