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 #4 Jul 30 2014 16:59:19
%S 0,0,0,0,1,0,1,0,2,0,2,0,1,1,3,1,3,1,2,1,4,1,3,2,3,2,5,1,5,3,3,2,4,2,
%T 7,3,4,3,7,2,8,3,4,3,9,3,8,3,6,4,10,3,7,4,6,5,11,3,11,5,6,6,9,4,12,6,
%U 8,4,13,4,14,6,7,7,11,4,15,6,10,7,16
%N Integer part of sum of fractions A182972(k) / A182973(k) such that A182972(k) + A182973(k) = n.
%C A245718(n) = floor(A245677(n)/A245678(n)).
%H Reinhard Zumkeller, <a href="/A245718/b245718.txt">Table of n, a(n) for n = 3..1000</a>
%e See A245677.
%o (Haskell)
%o a245718 n = a245677 n `div` a245678 n
%Y Cf. A245677, A245678, A182972, A182973.
%K nonn
%O 3,9
%A _Reinhard Zumkeller_, Jul 30 2014