(1) Number of solutions to x^2 == 0 (mod n). (2) Also square root of largest square dividing n. (3) Also max_{ d divides n } gcd(d, n/d).
A000188
(1) Number of solutions to x^2 == 0 (mod n). (2) Also square root of largest square dividing n. (3) Also max_{ d divides n } gcd(d, n/d).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =1a(7) =2a(8) =3a(9) =1a(10) =1a(11) =2a(12) =1a(13) =1a(14) =1a(15) =4a(16) =1a(17) =3a(18) =1a(19) =2a(20) =1a(21) =1a(22) =1a(23) =2a(24) =5a(25) =1a(26) =3a(27) =2a(28) =1a(29) =1
External references
- oeis: A000188