A365549 - OEIS

A365549

The number of exponentially odd divisors of the square root of the largest square dividing n.

1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

First differs from A278908, A307848, A323308 and A358260 at n = 64.

The number of exponentially odd divisors of the largest square dividing n is the same as the number of squares dividing n, A046951(n).

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A322483(A000188(n)).

a(n) >= 1 with equality if and only if n is squarefree (A005117).

Multiplicative with a(p^e) = 2 + floor((e-2)/4).