OFFSET
1,1
COMMENTS
REFERENCES
See A120498
LINKS
T. D. Noe, Table of n, a(n) for n=1..1269 (for c up to 10^6)
Sander R. Dahmen, Lower bounds for numbers of ABC-hits, J. Numb. Theory, Volume 128, Issue 6, June 2008, pp. 1864-1873.
Noam D. Elkies, The ABC's of Number Theory, The Harvard College Mathematics Review, Vol. 1, No. 1, Spring 2007, pp. 57-76.
Brian Hayes, Easy as abc
Wikipedia, abc conjecture
EXAMPLE
81 appears twice because 1+80=81 and 32+49=81 are two abc-hits.
MATHEMATICA
rad[n_] := If[n==1, 1, Times@@(Transpose[FactorInteger[n]][[1]])]; nn=1000; Do[If[ !PrimeQ[c], Do[b=c-a; If[GCD[a, b]==1 && rad[a*b*c]<c, Print[{a, b, c, rad[a*b*c]}]], {a, c/2}]], {c, 2, nn}]
PROG
(Python)
from itertools import count, islice
from math import prod, gcd
from sympy import primefactors
def A130510_gen(startvalue=1): # generator of terms >= startvalue
for c in count(max(startvalue, 1)):
pc = set(primefactors(c))
for a in range(1, (c>>1)+1):
b = c-a
if gcd(a, b)==1 and c>prod(set(primefactors(a))|set(primefactors(b))|pc):
yield c
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Jun 01 2007
STATUS
approved