id:A072906 - OEIS Search Results

Search: id:A072906

Displaying 1-1 of 1 results found.

page 1

Least k >=1 such that floor(n/k) is square-free.

+0
1

1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 2, 1, 1, 1, 3, 1, 3, 1, 2, 1, 1, 1, 4, 4, 1, 2, 2, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 7, 7, 5, 1, 2, 1, 4, 1, 4, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 5, 1, 1, 2, 2, 1, 1, 1, 3, 6, 1, 1, 2, 1, 1, 1, 3, 1, 3, 1, 2, 1, 1, 1, 5, 1, 5, 3, 3, 1, 1, 1, 3, 1 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`sum(k=1, a(k)) is asymptotic to C*n with C=1.9091.....`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=1; while(issquarefree(floor(n/s))==0, s++); s)`
	CROSSREFS	`Sequence in context: A130580 A110541 A079115 this_sequence A118923 A047010 A047100` `Adjacent sequences: A072903 A072904 A072905 this_sequence A072907 A072908 A072909`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 10 2002`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research