login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A081259
a(n) is the smallest k such that C(3n,n) divides k!.
1
2, 5, 7, 11, 13, 17, 19, 23, 23, 29, 31, 31, 37, 41, 43, 47, 47, 53, 53, 59, 61, 61, 67, 71, 73, 73, 79, 83, 83, 89, 89, 89, 97, 101, 103, 107, 109, 113, 113, 113, 113, 113, 127, 131, 131, 137, 139, 139, 139, 149, 151, 151, 157, 157, 163, 167, 167, 173, 173, 179, 181
OFFSET
1,1
COMMENTS
a(n) is the largest prime < 3n. More generally the smallest k such that C(mn,n) divides k! is the largest prime < mn.
FORMULA
a(n) = A151799(3n). - R. J. Mathar, Jul 18 2015
MATHEMATICA
NextPrime[3Range[70], -1] (* Harvey P. Dale, Oct 20 2011 *)
PROG
(PARI) a(n)=if(n<0, 0, s=1; while(k!%binomial(3*n, n)>0, k++); k)
CROSSREFS
Sequence in context: A229470 A157829 A020581 * A177512 A118751 A173494
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 20 2003
STATUS
approved