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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214740 Least m>0 such that n-m divides 2^n+m. 1
 1, 2, 2, 4, 1, 2, 2, 8, 8, 10, 8, 8, 5, 14, 8, 10, 16, 12, 8, 8, 3, 22, 4, 16, 11, 20, 5, 28, 28, 20, 5, 8, 32, 34, 32, 4, 4, 38, 12, 40, 40, 24, 14, 34, 24, 22, 11, 16, 32, 14, 14, 36, 52, 36, 4, 56, 56, 52, 14, 12, 29, 62, 24, 64, 1, 2, 32, 62, 68, 58, 64, 6, 16, 74, 72 (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 x|y is false; then 11#4097, 10#4098, 9#4099, 8#4100, 7#4101, 6#4102, 5#4103, 4|4104, so a(12) = 8. MATHEMATICA Table[m = 1; While[! Divisible[2^(n-1)+m, n - m], m++]; m, {n, 2, 100}] CROSSREFS Cf. A214739. Sequence in context: A034951 A317826 A317836 * A064848 A212791 A175001 Adjacent sequences:  A214737 A214738 A214739 * A214741 A214742 A214743 KEYWORD nonn,easy AUTHOR Clark Kimberling, Jul 28 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 28 13:29 EST 2020. Contains 331321 sequences. (Running on oeis4.)