|
|
A048098
|
|
Numbers k that are sqrt(k)-smooth: if p | k then p^2 <= k when p is prime.
|
|
54
|
|
|
1, 4, 8, 9, 12, 16, 18, 24, 25, 27, 30, 32, 36, 40, 45, 48, 49, 50, 54, 56, 60, 63, 64, 70, 72, 75, 80, 81, 84, 90, 96, 98, 100, 105, 108, 112, 120, 121, 125, 126, 128, 132, 135, 140, 144, 147, 150, 154, 160, 162, 165, 168, 169, 175, 176, 180, 182, 189, 192, 195
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This set (say S) has density d(S) = 1-log(2) and multiplicative density m(S) = 1-exp(-Gamma). Multiplicative density: let A be a set of numbers, A(x) = { k in A | gpf(k) <=x } where gpf(k) denotes the greatest prime factor of k and let m(x)(A) = Product_{p<=x} (1 - 1/p)*Sum_{k in A(x)} 1/k. If lim_{x->infinity} m(x)(A) exists = m(A), this limit is called "multiplicative density" of A (Erdős and Davenport, 1951). - Benoit Cloitre, Jun 12 2002
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI)
print1(1, ", "); for(n=2, 1000, if(vecmax(factor(n)[, 1])<=sqrt(n), print1(n, ", ")))
(Haskell)
a048098 n = a048098_list !! (n-1)
a048098_list = [x | x <- [1..], a006530 x ^ 2 <= x]
(Python)
from sympy import factorint
def ok(n):
return n == 1 if n < 2 else max(factorint(n))**2 <= n
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|