%N Least k such that for any p prime dividing n, p does not divide binomial((n+1)*k,k+1) or 0 if no k was found.
%C It seems that if p is prime a(6p) doesn't exist.
%F It seems that if p is prime a(p^m)=p^m-1 m>0
%o (PARI) D(k,n)=binomial((n+1)*k,k+1); div(n)=divisors(n); a(n)=if(n<0,0,k=1; while(prod(i=1,numdiv(n),D(k,n)%if(isprime(component(div(n),i)), component(div(n),i),D(k,n)+1)) == 0,k++); k)
%A _Benoit Cloitre_, Oct 14 2002