A072909 - OEIS

This site is supported by donations to The OEIS Foundation.

A072909

Least k>0 such that n+k is squarefree.

1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 4, 3, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 1, 1, 2, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	FORMULA	`It seems that sum(k=1, n, a(k) ) is asymptotic to C*n with C=1.5...`
	PROG	`(PARI) a(n)=if(n<0, 0, s=1; while(issquarefree(n+s)==0, s++); s)`
	CROSSREFS	`Sequence in context: A096669 A096591 A115568 * A095691 A067029 A087179` `Adjacent sequences: A072906 A072907 A072908 * A072910 A072911 A072912`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 10 2002`

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

Last modified February 15 15:14 EST 2012. Contains 205823 sequences.