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”).

A326055
a(n) = n - {the largest square that divides n}.
6
0, 1, 2, 0, 4, 5, 6, 4, 0, 9, 10, 8, 12, 13, 14, 0, 16, 9, 18, 16, 20, 21, 22, 20, 0, 25, 18, 24, 28, 29, 30, 16, 32, 33, 34, 0, 36, 37, 38, 36, 40, 41, 42, 40, 36, 45, 46, 32, 0, 25, 50, 48, 52, 45, 54, 52, 56, 57, 58, 56, 60, 61, 54, 0, 64, 65, 66, 64, 68, 69, 70, 36, 72, 73, 50, 72, 76, 77, 78, 64, 0, 81, 82, 80, 84
OFFSET
1,3
LINKS
FORMULA
a(n) = n - A008833(n).
a(n) = A326054(n) + A033879(n).
a(A000203(n)) = A326040(n).
MATHEMATICA
Table[n-Max[Select[Divisors[n], IntegerQ[Sqrt[#]]&]], {n, 100}] (* Harvey P. Dale, Apr 21 2020 *)
PROG
(PARI)
A008833(n) = (n/core(n));
A326055(n) = (n-A008833(n));
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 05 2019
STATUS
approved