The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133909 Least odd number m such that binomial(n+m,m) mod m = 1. 0
 3, 3, 5, 5, 7, 7, 9, 9, 3, 3, 3, 13, 17, 17, 17, 17, 19, 3, 3, 3, 23, 23, 25, 25, 5, 5, 3, 3, 3, 31, 37, 37, 37, 37, 37, 3, 3, 3, 41, 41, 43, 43, 47, 47, 3, 3, 3, 49, 7, 5, 5, 5, 5, 3, 3, 3, 9, 9, 9, 61, 67, 67, 3, 3, 3, 67, 71, 71, 71, 71, 73, 3, 3, 3, 5, 5, 5, 5, 5, 83, 3, 3, 3, 89, 89, 89, 9, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE a(3)=5, since binomial(3+5,5) mod 5 = 56 mod 5 = 1 and 5 is the minimal odd number with this property. a(8)=9 because of binomial(8+9,9)=24310=2701*9+1, but binomial(8+k,k) mod k<>1 for all odd numbers <9. CROSSREFS Cf. A000040, A133620, A133621, A133623, A133630, A133635. Cf. A133872, A133880, A133890, A133900, A133910. Sequence in context: A061794 A088524 A129337 * A177691 A206913 A117767 Adjacent sequences:  A133906 A133907 A133908 * A133910 A133911 A133912 KEYWORD nonn AUTHOR Hieronymus Fischer, Oct 20 2007 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 October 24 19:46 EDT 2020. Contains 338009 sequences. (Running on oeis4.)