A214751 - OEIS

%I #6 Aug 02 2012 14:55:04

%S 1,2,1,1,2,2,7,5,3,3,4,4,10,14,5,5,6,6,12,17,7,7,8,8,22,16,9,9,10,10,

%T 19,29,11,11,12,12,27,23,13,13,14,14,36,32,15,15,16,16,30,43,17,17,18,

%U 18,40,34,19,19,20,20,37,62,21,21,22,22,60,41,23,23,24,24,70

%N Least m>0 such that n-m divides ceiling(n/2)+ceiling(m/2).

%H Clark Kimberling, <a href="/A214751/b214751.txt">Table of n, a(n) for n = 2..1000</a>

%e Write x#y if x|y is false; then 8#6, 7#6, 6#7, 5#7, 4|8, so a(9) = 5.

%t Table[m = 1; While[! Divisible[Ceiling[n/2]+Ceiling[m/2],n-m], m++]; m, {n, 2, 100}]

%K nonn,easy

%O 2,2

%A _Clark Kimberling_, Jul 29 2012