OFFSET
1,3
COMMENTS
For n > 1, a(n) = the least squarefree number x >= n/2 for which n-x is also squarefree.
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 squarefree numbers for which x <= y and x+y = n, sequences A285734 and A285735 give the unique pair for which the difference y-x is the least 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 - A285734(n).
PROG
(Python)
from sympy.ntheory.factor_ import core
def issquarefree(n): return core(n) == n
def a285734(n):
if n==1: return 0
j=n//2
while True:
if issquarefree(j) and issquarefree(n - j): return j
else: j-=1
def a285735(n): return n - a285734(n)
print([a285735(n) for n in range(1, 101)]) # Indranil Ghosh, May 02 2017
(PARI) a(n)=for(x=(n+1)\2, n, if(issquarefree(x) && issquarefree(n-x), return(x))); 1 \\ Charles R Greathouse IV, Nov 05 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 02 2017
STATUS
approved