|
Search: id:A067514
|
|
|
| A067514 |
|
Number of distinct primes of the form floor(n/k) for 1<=k<=n. |
|
+0
3
|
|
| 0, 1, 1, 1, 2, 2, 3, 1, 2, 3, 4, 2, 3, 3, 4, 3, 4, 2, 3, 3, 4, 5, 6, 2, 3, 4, 4, 4, 5, 4, 5, 3, 4, 5, 6, 4, 5, 5, 6, 4, 5, 4, 5, 5, 5, 6, 7, 3, 4, 4, 5, 6, 7, 5, 6, 5, 6, 7, 8, 4, 5, 5, 5, 4, 5, 6, 7, 7, 8, 7, 8, 4, 5, 5, 5, 5, 6, 7, 8, 6, 6, 7, 8, 4, 5, 6, 7, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 5, 6, 5, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
EXAMPLE
|
a(10)=3 as floor(10/k) for k = 1 to 10 is 10,5,3,2,2,1,1,1,1,1, respectively; the 3 primes are 5,3,2.
|
|
MATHEMATICA
|
a[n_] := Length[Union[Select[Table[Floor[n/i], {i, 1, n}], PrimeQ]]]
|
|
CROSSREFS
|
Cf. A068050.
Adjacent sequences: A067511 A067512 A067513 this_sequence A067515 A067516 A067517
Sequence in context: A034968 A054707 A055460 this_sequence A115323 A089282 A079688
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 12 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Feb 12 2002
|
|
|
Search completed in 0.002 seconds
|
