This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248136 Least positive integer m such that m + n divides D(m) + D(n), where D(.) is given by A001850. 6
 1, 20, 3, 6, 1, 4, 200, 299, 5, 29, 4, 119, 5, 61, 3, 3, 6, 64, 31, 2, 21, 35, 6, 2974, 17, 1052, 27, 109, 10, 4, 3, 50, 65, 177, 22, 29, 5, 25, 15, 29, 29, 584, 83, 163, 9, 152, 19, 19, 29, 32, 15, 35, 4, 25, 239, 1122, 185, 76, 35, 97 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture: a(n) exists for any n > 0. LINKS Zhi-Wei Sun, Table of n, a(n) for n = 1..10000 EXAMPLE a(2) = 20 since 2 + 20 = 22 divides D(2) + D(20) = 13 + 260543813797441 = 260543813797454 = 22*11842900627157. MATHEMATICA d[n_]:=Sum[Binomial[n, k]Binomial[n+k, k], {k, 0, n}] Do[m=1; Label[aa]; If[Mod[d[m]+d[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}] CROSSREFS Cf. A001850, A247824, A247937, A247940, A248124, A248125, A248133, A248137, A248139, A248142. Sequence in context: A195600 A118295 A070645 * A040392 A317320 A040388 Adjacent sequences:  A248133 A248134 A248135 * A248137 A248138 A248139 KEYWORD nonn AUTHOR Zhi-Wei Sun, Oct 02 2014 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 20 23:20 EST 2019. Contains 319343 sequences. (Running on oeis4.)