A new term of an integer sequence computed with Rust
Claude Code helped write Rust that calculated the next term of OEIS sequence A321230, using modular arithmetic to beat the 64-bit limit.
Credits
- Reddit poster DanielBaldielocks Source ↗
Earliest dated source:
The full story
The maker used Claude Code to help write Rust code that calculates the next term of OEIS sequence A321230. The value would not fit in a 64-bit integer, so Claude used the Chinese Remainder Theorem: calculating modulo three large primes under 2^63 and rebuilding the value from two of them, with the third as a cross-check.
The submission of the new term is under review.
How it was done
Tools
Themes
Loading themes…
Sources
From a short post by the maker, so the details are as they tell them.
- Reddit: Claude Code Addition to OEIS Sequence A321230Reddit poster: DanielBaldielocksPosted
The maker's post on r/ClaudeCode.
If it disappears: archived copy of Reddit: Claude Code Addition to OEIS Sequence A321230 (opens in a new tab)
- The project: oeis.org
Linked in the post.