|
| |
|
|
A112929
|
|
Number of squarefree integers not exceeding the n-th prime.
|
|
7
| |
|
|
1, 2, 3, 5, 7, 8, 11, 12, 15, 17, 19, 23, 26, 28, 30, 32, 36, 37, 41, 44, 45, 49, 51, 55, 60, 61, 63, 66, 67, 70, 77, 80, 83, 85, 91, 92, 95, 99, 102, 104, 108, 109, 116, 117, 120, 121, 129, 138, 140, 141, 144, 148, 149, 153, 157, 161, 165, 166, 169, 171, 173, 179, 187
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(n) = order of n-th term of A112925 among squarefree integers.
a(n) = A175046(A000040(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 05 2010]
|
|
|
LINKS
| Diana Mecum, Table of n, a(n) for n = 1..200
|
|
|
FORMULA
| A005117(a(n)) = A112925(n). - R. J. Mathar, Apr 19 2008
|
|
|
EXAMPLE
| a(5)=7 because the 5th prime is 11 and the squarefree numbers not exceeding 11 are: 2,3,5,6,7,10,11.
The 5th term of A112925 is 10 and 10 is the 7th squarefree integer (with 1 counted as the first squarefree integer). So a(5) = 7.
|
|
|
MAPLE
| with(numtheory): a:=proc(n) local p, B, j: p:=ithprime(n): B:={}: for j from 2 to p do if abs(mobius(j))>0 then B:=B union {j} else B:=B fi od: nops(B) end: seq(a(m), m=1..75);
|
|
|
MATHEMATICA
| f[n_] := Prime[n] - Sum[ If[ MoebiusMu[k]]==0, 1, 0], {k, Prime[n]}] - 1; Table[ f[n], {n, 63}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 15 2005)
|
|
|
CROSSREFS
| Cf. A112925, A112926, A061400, A112928, A112930.
Sequence in context: A083028 A189168 A182799 * A099519 A014121 A051600
Adjacent sequences: A112926 A112927 A112928 * A112930 A112931 A112932
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Leroy Quet Oct 06 2005 and Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 14 2005
|
|
|
EXTENSIONS
| More terms from Diana Mecum (diana.mecum(AT)gmail.com), May 29 2007
Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 26 2008 at the suggestion of R. J. Mathar.
|
| |
|
|
