A256447 Number of integers in range (prime(n)^2)+1 .. (prime(n)*prime(n+1)) whose smallest prime factor is at least prime(n): a(n) = A250477(n) - A250474(n).
2, 3, 3, 7, 5, 9, 6, 13, 23, 9, 28, 22, 12, 24, 39, 37, 17, 44, 32, 16, 53, 37, 53, 76, 46, 23, 43, 20, 49, 161, 48, 82, 23, 142, 27, 91, 90, 66, 103, 97, 41, 181, 41, 74, 39, 228, 228, 86, 45, 86, 130, 44, 217, 134, 141, 138, 46, 148, 106, 47, 261, 355, 116, 53, 109, 387, 166, 284, 65, 119, 181, 243, 198, 195, 122, 190, 268, 125, 265, 330, 78
Offset: 1
Keywords
Examples
For n=1, we have in range [(prime(1)^2)+1, (prime(1) * prime(2))], that is, in range [5,6], two numbers, 5 and 6, whose smallest prime factor (A020639) is at least 2, thus a(1) = 2. For n=2, we have in range [10, 15] three numbers, {11, 13, 15}, whose smallest prime factor is at least 3, thus a(2) = 3. For n=3, we have in range [26, 35] three numbers, {29, 31, 35}, whose smallest prime factor is at least prime(3) = 5, thus a(3) = 3.
Links
- Antti Karttunen, Table of n, a(n) for n = 1..564
- A. Karttunen, Ratio a(n)/A256448(n) plotted with OEIS Plot2-script
- A. Karttunen, Ratio a(n)/A251723(n) plotted with OEIS Plot2-script
Programs
-
Mathematica
f[n_] := Count[Range[Prime[n]^2 + 1, Prime[n] Prime[n + 1]], x_ /; Min[First /@ FactorInteger[x]] >= Prime@n]; Array[f, 81] (* Michael De Vlieger, Mar 30 2015 *)
-
Scheme
(define (A256447 n) (- (A250477 n) (A250474 n)))
Comments