id:A048276 - OEIS Search Results

Search: id:A048276

Displaying 1-1 of 1 results found.

page 1

a(n) = number of square-free numbers among C(n,k), k=0..n.

+0
4

2, 3, 4, 3, 6, 6, 8, 3, 2, 6, 12, 4, 10, 12, 14, 2, 6, 2, 8, 8, 10, 12, 24, 4, 4, 8, 2, 4, 12, 6, 12, 2, 4, 8, 8, 2, 8, 14, 12, 4, 12, 14, 26, 16, 8, 20, 42, 2, 2, 2, 4, 6, 18, 4, 6, 2, 6, 10, 22, 8, 26, 40, 8, 2, 4, 6, 8, 8, 16, 12, 18, 2, 8, 18, 4, 6, 14, 18, 34, 2, 2, 4, 6, 4, 10, 12, 16, 4 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`If n=20, then C[ 20,k ] is square-free for k = 0,2,4,8,12,16,18,20 i.e. for 8 cases of k, so a[ 20 ]=8.`
	CROSSREFS	`A005117, A046098, A048277.` `Sequence in context: A126801 A076945 A074792 this_sequence A127463 A076618 A116550` `Adjacent sequences: A048273 A048274 A048275 this_sequence A048277 A048278 A048279`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified December 4 08:07 EST 2009. Contains 170310 sequences.

AT&T Labs Research