id:A133909 - OEIS Search Results

Search: id:A133909

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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; listen)

	OFFSET	`1,1`
	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 this_sequence A117767 A063196 A127630` `Adjacent sequences: A133906 A133907 A133908 this_sequence A133910 A133911 A133912`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 20 2007`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research