login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075861 Least k such that (n-k) divides (n+k). 0
1, 1, 2, 3, 2, 5, 4, 3, 5, 9, 4, 11, 7, 5, 8, 15, 6, 17, 10, 7, 11, 21, 8, 15, 13, 9, 14, 27, 10, 29, 16, 11, 17, 21, 12, 35, 19, 13, 20, 39, 14, 41, 22, 15, 23, 45, 16, 35, 25, 17, 26, 51, 18, 33, 28, 19, 29, 57, 20, 59, 31, 21, 32, 39, 22, 65, 34, 23, 35, 69, 24, 71, 37, 25, 38 (list; graph; refs; listen; history; internal format)
OFFSET

2,3

FORMULA

sum(i=1, n, a(i)) is asymptotic to c*n^2 where c=0.28....

MATHEMATICA

Table[i=1; While[!Divisible[n+i, n-i], i++]; i, {n, 2, 100}]  (* From Harvey P. Dale, Mar 28 2011 *)

PROG

(PARI) a(n)=if(n<0, 0, s=1; while((n+s)%(n-s)>0, s++); s)

CROSSREFS

Sequence in context: A011153 A132226 A197702 * A205706 A141658 A089587

Adjacent sequences:  A075858 A075859 A075860 * A075862 A075863 A075864

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 15 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.