This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075833 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. 0
 1, 1, 2, 3, 4, 11, 6, 7, 8, 29, 10, 0, 12, 55, 29, 15, 16, 0, 18, 259, 62, 131, 22, 71, 24, 519, 26, 55, 28, 0, 30, 31, 32, 305, 34, 0, 36, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS It seems that if p is prime a(6p) doesn't exist. LINKS FORMULA It seems that if p is prime a(p^m)=p^m-1 m>0 PROG (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) CROSSREFS Sequence in context: A065633 A160652 A131485 * A265904 A117351 A108467 Adjacent sequences:  A075830 A075831 A075832 * A075834 A075835 A075836 KEYWORD more,nonn AUTHOR Benoit Cloitre, Oct 14 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 19:44 EDT 2019. Contains 323597 sequences. (Running on oeis4.)