|
| |
|
|
A071705
|
|
Least k > n such that C(2n,n) divides C(2k,k).
|
|
0
| |
|
|
1, 2, 5, 9, 13, 20, 18, 21, 20, 63, 50, 131, 111, 67, 197, 113, 113, 338, 335, 173, 426, 110, 110, 554, 515, 515, 368, 368, 515, 928, 928, 1269, 1152, 1152, 1269, 1511, 1462, 1456, 1458, 1458, 2524, 2181, 2895, 2895, 2895, 2805, 3379, 3379, 3640, 2808, 3284
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
MATHEMATICA
| f[n_] := Block[{k = n + 1}, bn = Binomial[2n, n]; While[ !IntegerQ[ Binomial[2k, k]/bn], k++ ]; k]; Table[ f[n], {n, 0, 50}]
|
|
|
PROG
| (PARI) for(n=1, 45, s=n+1; while(binomial(2*s, s)%binomial(2*n, n)>0, s++); print1(s, ", "))
|
|
|
CROSSREFS
| Sequence in context: A122489 A120615 A038707 * A190713 A109094 A049753
Adjacent sequences: A071702 A071703 A071704 * A071706 A071707 A071708
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 24 2002
|
|
|
EXTENSIONS
| Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 27 2002
|
| |
|
|
