login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A338430
Number of numbers less than sqrt(n) whose square does not divide n.
6
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 3, 2, 2, 3, 3, 3, 1, 3, 3, 3, 2, 4, 4, 4, 3, 4, 4, 4, 3, 3, 4, 4, 2, 5, 4, 5, 4, 5, 4, 5, 4, 5, 5, 5, 4, 5, 5, 4, 4, 6, 6, 6, 5, 6, 6, 6, 3, 6, 6, 5, 5, 6, 6, 6, 4, 6, 7, 7, 6, 7, 7, 7, 6, 7, 6, 7, 6
OFFSET
1,17
LINKS
FORMULA
a(n) = floor(sqrt(n)) - 1 - Sum_{k=1..sqrt(n)-1} (1 - ceiling(n/k^2) + floor(n/k^2)).
EXAMPLE
a(16) = 1: floor(sqrt(16))-1 = 3 and 3^2 does not divide 16, so a(16) = 1;
a(17) = 2: floor(sqrt(17))-1 = 3 and the squares of 2 and 3 do not divide 17, so a(17) = 2.
MATHEMATICA
Table[Sum[Ceiling[n/k^2] - Floor[n/k^2], {k, Sqrt[n] - 1}], {n, 100}]
PROG
(PARI) a(n) = sum(k=1, floor(sqrt(n))-1, if (n % k^2, 1)); \\ Michel Marcus, Jan 31 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Jan 30 2021
STATUS
approved