id:A081768 - OEIS Search Results

Search: id:A081768

Displaying 1-1 of 1 results found.

page 1

Number of k, 1<=k<=n, such that C(n,k) divides C(2n,2k).

+0
1

1, 2, 3, 3, 5, 5, 3, 7, 7, 5, 7, 5, 7, 11, 9, 3, 5, 13, 9, 13, 7, 3, 11, 9, 7, 9, 7, 11, 11, 9, 3, 9, 23, 13, 19, 9, 3, 7, 11, 7, 11, 9, 9, 9, 7, 7, 5, 19, 13, 23, 15, 7, 17, 13, 9, 7, 5, 5, 7, 11, 11, 11, 19, 11, 15, 9, 11, 21, 19, 11, 9, 9, 9, 13, 11, 5, 13, 21, 9, 11, 15, 7, 13, 9, 7, 11, 7, 15 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Is a(n) odd for n>2 ? All odd numbers occur? Does equation a(x)=2m+1 have infinitely many solutions for any m>=1?`
	CROSSREFS	`Sequence in context: A158745 A103310 A046146 this_sequence A072923 A131922 A113730` `Adjacent sequences: A081765 A081766 A081767 this_sequence A081769 A081770 A081771`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 09 2003`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research