%I
%S 0,0,1,0,0,1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,1,1,0,1,0,0,1,2,0,0,1,0,1,0,
%T 1,1,0,0,2,1,0,0,1,0,1,1,0,2,0,0,0,1,1,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,
%U 2,1,0,0,2,0,0,0,0,3,0,1,1,0,0,1,1,0,1,1,0,1
%N a(n) = s(1)s(n) + s(2)s(n1) + ... + s(k)s(n+1k), where k=[ (n+1)/2) ], s = A023531.
%H Reinhard Zumkeller, <a href="/A024316/b024316.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o a024316 n = sum $ take (div (n + 1) 2) $ zipWith (*) zs $ reverse zs
%o where zs = take n $ tail a023531_list
%o  _Reinhard Zumkeller_, Feb 14 2015
%K nonn
%O 1,28
%A _Clark Kimberling_
