A248139 Least positive integer m such that m + n divides f(m) + f(n), where f(.) is given by A000172.

1, 1, 25, 6, 14, 4, 13, 49, 19, 10, 2, 56, 2, 5, 6, 5, 27, 61, 9, 33, 23, 53, 21, 15, 3, 24, 11, 58, 39, 118, 3, 1598, 20, 40, 4, 2, 58, 26, 29, 17, 47, 34, 4, 31, 43, 163, 41, 25, 8, 26, 67, 40, 21, 214, 535, 12, 7, 22, 164, 74

Offset

1,3

Comments

Conjecture: a(n) exists for any n > 0.

Links

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000

Example

a(5) = 14 since 5 + 14 = 19 divides f(5) + f(14) = 2252 + 112738423360 = 112738425612 = 19*5933601348.

Mathematica

f[n_]:=Sum[Binomial[n, k]^3, {k, 0, n}]
Do[m=1; Label[aa]; If[Mod[f[m]+f[n], m+n]==0, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 1, 60}]

Crossrefs

Cf. A000172, A247824, A247937, A247940, A248124, A248125, A248133, A248136, A248137, A248142.

Sequence in context: A110796 A040609 A040607 * A224807 A040606 A091736

Adjacent sequences: A248136 A248137 A248138 * A248140 A248141 A248142

Keyword

nonn

Author

Zhi-Wei Sun, Oct 02 2014

Status

approved