id:A133906 - OEIS Search Results

Search: id:A133906

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`1,1`
	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.`
	CROSSREFS	`Cf. A000040, A133620, A133621, A133623, A133630, A133635.` `Cf. A133872, A133880, A133890, A133900, A133910.` `Sequence in context: A011157 A060441 A065996 this_sequence A133907 A060084 A138182` `Adjacent sequences: A133903 A133904 A133905 this_sequence A133907 A133908 A133909`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 20 2007`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research