This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A133908 #4 Jun 27 2012 14:42:29
%S A133908 3,3,5,5,7,7,11,11,3,3,3,13,17,17,17,17,19,3,3,3,23,23,29,29,5,5,3,3,
%T A133908 3,31,37,37,37,37,37,3,3,3,41,41,43,43,47,47,3,3,3,53,7,5,5,5,5,3,3,3,
%U A133908 59,59,61,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
%N A133908 Least odd prime number m such that binomial(n+m,m) mod m = 1.
%C A133908 Also the least odd prime number m such that m divides floor(n/m) or m>n.
%H A133908 Harvey P. Dale, <a href="/A133908/b133908.txt">Table of n, a(n) for n = 1..1000</a>
%e A133908 a(3)=5, since binomial(3+5,5) mod 5 = 56 mod 5 = 1 and 5 is the minimal odd prime number with this property.
%e A133908 a(8)=11 because of binomial(8+11,11)=75582=6871*11+1, but binomial(8+k,k) mod k<>1 for all odd primes <11.
%t A133908 With[{oprs=Rest[Prime[Range[100]]]},Flatten[Table[Select[oprs,Mod[ Binomial[ n+#,#],#]==1&,1],{n,90}]]] (* _Harvey P. Dale_, Jun 27 2012 *)
%Y A133908 Cf. A000040, A133620, A133621, A133623, A133630, A133635.
%Y A133908 Cf. A133872, A133880, A133890, A133900, A133910.
%K A133908 nonn
%O A133908 1,1
%A A133908 _Hieronymus Fischer_, Oct 20 2007