login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133906 Least number m such that binomial(n+m, m) mod m = 1. 5
2, 3, 5, 2, 2, 7, 9, 2, 2, 3, 3, 2, 2, 17, 17, 2, 2, 3, 3, 2, 2, 23, 25, 2, 2, 4, 3, 2, 2, 31, 37, 2, 2, 8, 8, 2, 2, 3, 41, 2, 2, 4, 4, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 4, 4, 2, 2, 67, 3, 2, 2, 44, 44, 2, 2, 16, 16, 2, 2, 3, 4, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 89, 9, 2, 2, 3, 3, 2, 2, 97, 97, 2, 2, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(1)=2, since binomial(1+2, 2) mod 2 = 3 mod 2 = 1 and 2 is the minimal number with this property.
a(7)=9 because of binomial(7+9, 9) = 11440 = 1271*9 + 1, but binomial(7+k, k) mod k <> 1 for all numbers < 9.
MATHEMATICA
Table[Block[{m = 1}, While[Mod[Binomial[n + m, m], m] != 1, m++]; m], {n, 98}] (* Michael De Vlieger, Jul 30 2018 *)
PROG
(PARI) a(n) = {my(m = 1, ok = 0); until (ok, if (binomial(n+m, m) % m == 1, ok = 1, m++); ); return (m); } \\ Michel Marcus, Jul 15 2013
CROSSREFS
Sequence in context: A060441 A255913 A065996 * A317358 A133907 A232931
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)