Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081768 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)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research