|
|
A333535
|
|
Card{ k<=n, k such that all prime divisors of k are < sqrt(k) }.
|
|
6
|
|
|
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 18, 18, 18, 18, 18, 18, 19, 19, 20, 20, 20, 21, 21, 21, 21, 21, 22, 23, 23, 23, 24, 24, 24, 24, 24, 24, 25
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
LINKS
|
|
|
MAPLE
|
a:=[];
for n from 1 to 100 do
c:=0;
for m from 1 to n do
if A006530(m)^2 < m then c:=c+1; fi; od:
a:=[op(a), c];
od:
a;
# second Maple program:
a:= proc(n) option remember; `if`(n<2, 0, a(n-1)+
`if`(max(map(i-> i[1], ifactors(n)[2]))^2<n, 1, 0))
end:
|
|
MATHEMATICA
|
a[1] = 0;
a[n_] := a[n] = a[n-1] + Boole[Max[FactorInteger[n][[All, 1]]]^2 < n];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|