The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Alois P. Heinz, Table of n, a(n) for n = 1..65536 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 11 03:22 EDT 2020. Contains 336421 sequences. (Running on oeis4.)