

A214751


Least m>0 such that nm divides ceiling(n/2)+ceiling(m/2).


1



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, 19, 29, 11, 11, 12, 12, 27, 23, 13, 13, 14, 14, 36, 32, 15, 15, 16, 16, 30, 43, 17, 17, 18, 18, 40, 34, 19, 19, 20, 20, 37, 62, 21, 21, 22, 22, 60, 41, 23, 23, 24, 24, 70
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,2


LINKS

Clark Kimberling, Table of n, a(n) for n = 2..1000


EXAMPLE

Write x#y if xy is false; then 8#6, 7#6, 6#7, 5#7, 48, so a(9) = 5.


MATHEMATICA

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


CROSSREFS

Sequence in context: A246402 A114551 A191620 * A306512 A239397 A307884
Adjacent sequences: A214748 A214749 A214750 * A214752 A214753 A214754


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Jul 29 2012


STATUS

approved



