|
Search: id:A133905
|
|
|
| A133905 |
|
Least composite number m such that binomial(n+m,m) mod m = 1. |
|
+0
2
|
|
| 4, 9, 25, 10, 26, 9, 9, 9, 6, 4, 4, 34, 34, 85, 289, 4, 4, 57, 87, 8, 8, 25, 25, 25, 134, 4, 4, 15, 15, 111, 111, 4, 4, 8, 8, 10, 10, 121, 121, 82, 86, 4, 4, 49, 49, 49, 49, 4, 4, 265, 68, 10, 10, 8, 8, 6, 9, 4, 4, 194, 194, 469, 249, 4, 4, 44, 44, 146, 146, 16, 16, 6, 6, 4, 4, 162
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(1)=4, since binomial(1+4,4) mod 4 = 5 mod 4 = 1 and 4 is the minimal composite number with this property.
a(5)=26 because of binomial(5+26,26)=169911=6535*26+1, but binomial(5+k,k) mod k<>1 for all composite numbers <26.
|
|
CROSSREFS
|
Cf. A000040, A133620, A133621, A133623, A133630, A133635.
Cf. A133872, A133880, A133890, A133900, A133910.
Sequence in context: A081149 A059507 A128416 this_sequence A131826 A051961 A093867
Adjacent sequences: A133902 A133903 A133904 this_sequence A133906 A133907 A133908
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 20 2007
|
|
|
Search completed in 0.002 seconds
|
