cp's OEIS Frontend

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.

A133909 Least odd number m such that binomial(n+m,m) mod m = 1.

This page as a plain text file.
%I A133909 #2 Mar 31 2012 13:21:04
%S A133909 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,
%T A133909 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,
%U A133909 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
%N A133909 Least odd number m such that binomial(n+m,m) mod m = 1.
%e A133909 a(3)=5, since binomial(3+5,5) mod 5 = 56 mod 5 = 1 and 5 is the minimal odd number with this property.
%e A133909 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.
%Y A133909 Cf. A000040, A133620, A133621, A133623, A133630, A133635.
%Y A133909 Cf. A133872, A133880, A133890, A133900, A133910.
%K A133909 nonn
%O A133909 1,1
%A A133909 _Hieronymus Fischer_, Oct 20 2007