The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112926 Smallest squarefree integer > the n-th prime. 7
 3, 5, 6, 10, 13, 14, 19, 21, 26, 30, 33, 38, 42, 46, 51, 55, 61, 62, 69, 73, 74, 82, 85, 91, 101, 102, 105, 109, 110, 114, 129, 133, 138, 141, 151, 154, 158, 165, 170, 174, 181, 182, 193, 194, 199, 201, 213, 226, 229, 230, 235, 241, 246, 253, 258, 265, 271, 273 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Michael De Vlieger, Table of n, a(n) for n = 1..10000 EXAMPLE 10 is the smallest squarefree number greater than the 4th prime, 7. So a(4) = 10. MAPLE with(numtheory): a:=proc(n) local p, B, j: p:=ithprime(n): B:={}: for j from p+1 to p+20 do if abs(mobius(j))>0 then B:=B union {j} else B:=B fi od: B[1] end: seq(a(m), m=1..75); # Emeric Deutsch, Oct 10 2005 MATHEMATICA Do[k = Prime[n] + 1; While[ !SquareFreeQ[k], k++ ]; Print[k], {n, 1, 100}] (* Ryan Propper, Oct 10 2005 *) With[{k = 120}, Table[SelectFirst[Range[Prime@ n + 1, Prime@ n + k], SquareFreeQ], {n, 58}]] (* Michael De Vlieger, Aug 16 2017 *) PROG (PARI) a(n, p=prime(n))=while(!issquarefree(p++), ); p \\ Charles R Greathouse IV, Aug 16 2017 CROSSREFS Cf. A061400, A112925, A112928, A112929, A112930. Sequence in context: A265749 A115823 A190721 * A176747 A238488 A230124 Adjacent sequences:  A112923 A112924 A112925 * A112927 A112928 A112929 KEYWORD nonn AUTHOR Leroy Quet, Oct 06 2005 EXTENSIONS More terms from Ryan Propper and Emeric Deutsch, Oct 10 2005 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 May 15 04:03 EDT 2021. Contains 343909 sequences. (Running on oeis4.)