OFFSET
1,3
COMMENTS
For any n > 1 there is at least one decomposition of n as a sum of two squarefree numbers (cf. A071068 and the Mathematics Stack Exchange link). Of all pairs (x,y) of positive squarefree numbers for which x <= y and x+y = n, sequences A285718 and A285719 give the unique pair for which the difference y-x is the largest possible.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
Mathematics Stack Exchange, Sums of square free numbers, is this conjecture equivalent to Goldbach's conjecture? (See especially the answer of Aryabhata)
K. Rogers, The Schnirelmann density of the squarefree integers, Proc. Amer. Math. Soc. 15 (1964), pp. 515-516.
FORMULA
a(n) = n - A285718(n).
EXAMPLE
For n=51 we see that 50 (2*5*5), 49 (7*7) and 48 (2^4 * 3) are all nonsquarefree (A013929). 47 (a prime) is squarefree, but 51 - 47 = 4 is not. On the other hand, both 46 (2*23) and 5 are squarefree numbers, thus a(51) = 46.
MATHEMATICA
lsfn[n_]:=Module[{k=n-1}, While[!SquareFreeQ[k]||!SquareFreeQ[n-k], k--]; k]; Join[{1}, Array[ lsfn, 100, 2]] (* Harvey P. Dale, Apr 27 2023 *)
PROG
(Scheme)
(define (A285719 n) (if (= 1 n) n (let loop ((k (A013928 n))) (if (not (zero? (A008683 (- n (A005117 k))))) (A005117 k) (loop (- k 1))))))
(Python)
from sympy.ntheory.factor_ import core
def issquarefree(n): return core(n) == n
def a285718(n):
if n==1: return 0
x = 1
while True:
if issquarefree(x) and issquarefree(n - x):return x
else: x+=1
def a285719(n): return n - a285718(n)
print([a285719(n) for n in range(1, 121)]) # Indranil Ghosh, May 02 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 02 2017
STATUS
approved