login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214736 Least m>0 such that n-m divides n+1+m. 1
1, 2, 1, 4, 5, 2, 7, 8, 3, 10, 7, 4, 13, 14, 5, 10, 17, 6, 19, 20, 7, 22, 17, 8, 25, 16, 9, 28, 29, 10, 19, 32, 11, 34, 35, 12, 27, 38, 13, 40, 25, 14, 43, 32, 15, 28, 47, 16, 49, 50, 17, 52, 53, 18, 55, 34, 19, 42, 49, 20, 37, 62, 21, 64, 47, 22, 67, 68, 23, 58, 43 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
EXAMPLE
Write x#y if x|y is false; then 9#12, 8#13, and 7|14, so a(10) = 3.
MATHEMATICA
Table[m = 1; While[! Divisible[n+1+m, n - m], m++]; m, {n, 2, 100}]
CROSSREFS
Cf. A075861.
Sequence in context: A038502 A106610 A182398 * A051176 A145064 A209166
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)