|
Search: id:A112926
|
|
|
| A112926 |
|
Smallest squarefree integer > the n-th prime. |
|
+0
6
|
|
| 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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
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); (Deutsch)
|
|
MATHEMATICA
|
<<NumberTheory`; Do[k = Prime[n] + 1; While[ !SquareFreeQ[k], k++ ]; Print[k], {n, 1, 100}] (Propper)
|
|
CROSSREFS
|
Cf. A112925, A112927, A112928, A112929, A112930.
Sequence in context: A099190 A122772 A115823 this_sequence A027627 A115059 A092835
Adjacent sequences: A112923 A112924 A112925 this_sequence A112927 A112928 A112929
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Oct 06 2005
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 10 2005
|
|
|
Search completed in 0.002 seconds
|
