Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133907
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133907 Least prime number m such that binomial(n+m,m) mod m = 1. +0
1
2, 3, 5, 2, 2, 7, 11, 2, 2, 3, 3, 2, 2, 17, 17, 2, 2, 3, 3, 2, 2, 23, 29, 2, 2, 5, 3, 2, 2, 31, 37, 2, 2, 37, 37, 2, 2, 3, 41, 2, 2, 43, 47, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 59, 61, 2, 2, 67, 3, 2, 2, 67, 71, 2, 2, 71, 73, 2, 2, 3, 5, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 89, 89, 2, 2, 3, 3, 2, 2, 97 (list; graph; listen)
OFFSET

1,1

COMMENT

Also the least prime number m such that m divides floor(n/m) or m>n.

EXAMPLE

a(2)=3, since binomial(2+3,3) mod 3 = 10 mod 3 = 1 and 3 is the minimal prime number with this property.

a(7)=11 because of binomial(7+11,11)=31824=2893*11+1, but binomial(7+k,k) mod k<>1 for all primes <11.

CROSSREFS

Cf. A000040, A133620, A133621, A133623, A133630, A133635.

Cf. A133872, A133880, A133890, A133900, A133910.

Sequence in context: A060441 A065996 A133906 this_sequence A060084 A138182 A102044

Adjacent sequences: A133904 A133905 A133906 this_sequence A133908 A133909 A133910

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 20 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 23 10:48 EDT 2008. Contains 142285 sequences.


AT&T Labs Research