OFFSET
1,2
COMMENTS
Given A, B natural numbers, and C=A+B, the ABC conjecture deals with the ratio of the squarefree part of the product A*B*C, divided by C. Here, B plays the role of the OEIS index n.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
Abderrahmane Nitaj, The ABC conjecture homepage
Eric Weisstein's World of Mathematics, abc Conjecture
Wikipedia, ABC conjecture
EXAMPLE
For B=14, we have C=15, so SQP(ABC)=SQP(210)=2*3*5*7=210, so SQP(ABC)/C=210/15=14.
For B=19, we have C=20, so SQP(ABC)=SQP(380)=2*5*19=190, so SQP(ABC)/C=190/20=9.5, which rounds to 10.
MAPLE
seq(A190846(n), n=1..80) ; # R. J. Mathar, Jun 10 2011
MATHEMATICA
Array[Round[SelectFirst[Reverse@ Divisors[#1 #2], SquareFreeQ]/#2] & @@ {#, # + 1} &, 83] (* Michael De Vlieger, Feb 19 2019 *)
PROG
(Magma) SQP:=func< n | &*[ f[j, 1]: j in [1..#f] ] where f is Factorization(n) >; A190846:=func< n | Round(SQP(a*n*c)/c) where c is a+n where a is 1 >; [ A190846(n): n in [1..85] ]; // Klaus Brockhaus, May 27 2011
(PARI) rad(n)=my(f=factor(n)[, 1]); prod(i=1, #f, f[i])
a(n)=rad(n^2+n)\/(n+1) \\ Charles R Greathouse IV, Mar 11 2014
(Python)
from operator import mul
from sympy import primefactors
def rad(n): return 1 if n<2 else reduce(mul, primefactors(n))
def a(n): return int(round(rad(n**2 + n)/(n + 1))) # Indranil Ghosh, May 24 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Darrell Minor, May 25 2011
STATUS
approved