A214739 Least m>0 such that n-m divides 2^(n-1)+m.

1, 2, 1, 2, 4, 6, 4, 4, 1, 2, 2, 6, 3, 14, 4, 14, 8, 8, 16, 10, 16, 20, 10, 12, 12, 26, 1, 2, 28, 26, 12, 16, 8, 32, 32, 18, 28, 38, 11, 22, 5, 42, 40, 22, 28, 26, 4, 44, 24, 26, 2, 50, 23, 38, 12, 10, 27, 56, 16, 30, 24, 62, 16, 56, 32, 66, 40, 4, 19, 14, 32, 36, 36, 74

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 5#33, 4#34, 3#35, 2|36, so a(6) = 4.

Mathematica

Table[m = 1; While[! Divisible[2^(n-1)+m, n - m], m++]; m, {n, 2, 100}]

Crossrefs

Cf. A213740.

Sequence in context: A358918 A368058 A324225 * A296159 A283334 A301413

Adjacent sequences: A214736 A214737 A214738 * A214740 A214741 A214742

Keyword

nonn,easy

Author

Clark Kimberling, Jul 28 2012

Status

approved