This site is supported by donations to The OEIS Foundation.
User:Ludwig Knoblauch
From OeisWiki
I am a retired software engineer with amateur experience in computer-based prime number research. No scientific merits. My current work is on the abc conjecture.
In OEIS, I missed a sequence describing the distribution of so-called "abc hits" i.e. cases where coprime a and b yield a+b=c while rad(a*b*c) <= c. So I calculated a[n] = {number of abc hits with c < 2**n}. Maybe it's useful. If desired, I could provide a simple Python program for calculation.
