Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Aug 02 2018 11:54:16
%S 0,1,0,2,0,3,0,7,0,7,0,10,0,9,2,8,4,9,8,10,8,11,10,17,8,13,12,15,4,19,
%T 4,25,6,17,8,25,12,19,10,27,10,23,14,22,16,25,16,26,12,21,16,22,14,31,
%U 16,40,14,29,20,32,14,27,22,35,24,33,24,32,28,25,18
%N a(n) = number of k with 1 <= k <= n-1 such that a(k) + a(n-k) is not squarefree.
%C We consider that 0 is not squarefree.
%C The scatterplot of the sequence has stripes linked to the 2-adic valuation of n.
%C See A317420 for similar sequences.
%H Rémy Sigrist, <a href="/A317443/b317443.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A317443/a317443.png">Colored scatterplot of the first 1000000 terms</a> (where the color is function of A007814(n))
%e For n = 4:
%e - a(1) + a(3) = 0 + 0 = 0 is not squarefree,
%e - a(2) + a(2) = 1 + 1 = 2 is squarefree,
%e - a(3) + a(1) = 0 + 0 = 0 is not squarefree,
%e - hence a(4) = 2.
%o (PARI) a = vector(71); for (n=1, #a, a[n] = sum(k=1, n-1, !issquarefree(a[k]+a[n-k])); print1 (a[n] ", "))
%Y Cf. A007814, A013929, A317420.
%K nonn
%O 1,4
%A _Rémy Sigrist_, Jul 28 2018