OFFSET
2,1
COMMENTS
a(1) doesn't exist because 1 is coprime to all integers.
Terms are composite since primes either divide or are coprime to other numbers. - Michael De Vlieger, Feb 20 2025
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 2..10000
FORMULA
For composite n > 4, a(n) is the first term of row n of A133995. - Michael De Vlieger, Feb 20 2025
For even n, a(n) = min{p_i^(e_i + 1); i = 1.. ..A001221(n), 2*q}, where p_i^e_i is the greatest power of prime p_i dividing n, p_1 = 2, q = A053669(n); For odd n, a(n) = 2*A020639(n); See Example. - David James Sycamore, Feb 28 2025
EXAMPLE
From David James Sycamore, Feb 28 2025: (Start) Using above formula: n = 4235 = 5*7*11^2, so a(n) = 2*5 = 10.
For n = odd prime p, a(n) = 2*p.
For n = 2, a(n) = min{2^2, 2*3} = 4.
For n = 4, a(n) = min{2^3, 2*3} = 6. (For for all n = 2^k, (k >= 2), a(n) = 6.
For n = 120 = 2^3*3*5, a(n) = min{16, 9, 25, 14} = 9.
For n = 5040 = 2^4*3^2*5*7, a(n) = min{32, 27, 25, 49, 22} = 22.
For n = 3603600 = 2^4*3^2*5^2*7*11*13, a(n) = Min{32,27,125,49,121,169,34} = 27. (End)
MATHEMATICA
Table[k = 3; Until[1 < GCD[k, n] < k, k++]; k, {n, 2, 120}] (* Michael De Vlieger, Feb 20 2025 *)
PROG
(PARI) a(n)=for(k=4, 2*n, if(gcd(n, k)>1 && n%k, return(k))) \\ Charles R Greathouse IV, Apr 05 2013
(PARI) a(n)=my(f=factor(n), b); forprime(p=2, , if(n%p, b=p*f[1, 1]; break)); for(i=1, #f[, 1], b=min(b, f[i, 1]^(f[i, 2]+1))); b \\ Charles R Greathouse IV, Apr 05 2013
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Leroy Quet, Jun 01 2009
EXTENSIONS
Extended by Ray Chandler, Jun 13 2009
STATUS
approved