This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072937 Least k such that prime(n) appears in factorization of k! + 1. 1
 2, 4, 3, 5, 12, 16, 9, 14, 18, 30, 36, 40, 21, 23, 52, 15, 8, 18, 7, 72, 23, 13, 88, 96, 100, 6, 106, 86, 112, 63, 65, 16, 16, 50, 150, 156, 81, 166, 172, 89, 180, 95, 102, 196, 99, 210, 222, 61, 228, 64, 210, 240, 97, 31, 131, 9, 93, 40, 280, 282, 45, 63, 220, 312, 91 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS EXAMPLE 12!+1 = 13^2*2834329 and 12 is the smallest integer k such that 13 = prime(6) appears in k!+1 factorization, hence a(6)=12 PROG (PARI) a(n)=if(n<0, 0, s=1; while((s!+1)%prime(n)>0, s++); s) CROSSREFS Sequence in context: A297706 A093416 A073944 * A256640 A239466 A129509 Adjacent sequences:  A072934 A072935 A072936 * A072938 A072939 A072940 KEYWORD easy,nonn AUTHOR Benoit Cloitre, Aug 20 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 12:25 EST 2019. Contains 329895 sequences. (Running on oeis4.)