The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214745 Least m>0 such that n-m divides 2*n-1+m. 1
 1, 1, 3, 3, 5, 2, 7, 7, 9, 3, 5, 11, 13, 4, 15, 7, 17, 5, 19, 19, 9, 6, 23, 23, 15, 7, 27, 27, 29, 8, 13, 19, 33, 9, 35, 15, 37, 10, 23, 39, 17, 11, 43, 43, 45, 12, 35, 47, 49, 13, 21, 51, 31, 14, 55, 23, 57, 15, 59, 35, 25, 16, 63, 63, 65, 17, 39, 67, 51, 18, 29, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,3 LINKS Clark Kimberling, Table of n, a(n) for n = 2..1000 EXAMPLE Write x#y if x|y is false; then 10#22, 9#23, 8|24, so a(11) = 3. MATHEMATICA Table[m = 1; While[! Divisible[2n-1+m, n-m], m++]; m, {n, 2, 100}] CROSSREFS Sequence in context: A204154 A267089 A016555 * A115155 A136549 A302141 Adjacent sequences:  A214742 A214743 A214744 * A214746 A214747 A214748 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 29 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 09:35 EST 2020. Contains 331048 sequences. (Running on oeis4.)