|
|
A214751
|
|
Least m>0 such that n-m 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
|
|
|
EXAMPLE
|
Write x#y if x|y is false; then 8#6, 7#6, 6#7, 5#7, 4|8, so a(9) = 5.
|
|
MATHEMATICA
|
Table[m = 1; While[! Divisible[Ceiling[n/2]+Ceiling[m/2], n-m], m++]; m, {n, 2, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|