|
Search: id:A072119
|
|
|
| A072119 |
|
Least k such that k(k+1)(k+2)...(k+n) divides C(2k,k). |
|
+0
1
|
|
| 1, 15, 42, 153, 153, 209, 943, 1989, 3318, 11725, 14322, 30191, 96113
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
g[n_] := Block[{k = 1}, While[ !IntegerQ[ Binomial[2k, k] / Product[i, {i, k, k + n}]], k++ ]; Return[k]]; Table[ a[n], {n, 1, 13}]
|
|
PROGRAM
|
(PARI) for(n=1, 8, s=1; while(binomial(2*s, s)%prod(i=0, n, (s+i))>0, s++); print1(s, ", "))
|
|
CROSSREFS
|
Sequence in context: A154267 A051867 A008976 this_sequence A069127 A137183 A124708
Adjacent sequences: A072116 A072117 A072118 this_sequence A072120 A072121 A072122
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 19 2002
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 21 2002
|
|
|
Search completed in 0.002 seconds
|
