id:A075861 - OEIS Search Results

Search: id:A075861

Displaying 1-1 of 1 results found.

page 1

Least k such that (n-k) divides (n+k).

+0
1

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; listen)

	OFFSET	`2,3`
	FORMULA	`sum(i=1, n, a(i)) is asymptotic to c*n^2 where c=0.28....`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=1; while((n+s)%(n-s)>0, s++); s)`
	CROSSREFS	`Sequence in context: A141663 A011153 A132226 this_sequence A141658 A089587 A067316` `Adjacent sequences: A075858 A075859 A075860 this_sequence A075862 A075863 A075864`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 15 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research