login
A384231
Index of the largest odd noncomposite divisor in the list of divisors of n.
1
1, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 3, 1, 2, 3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 4, 2, 4, 2, 1, 3, 3, 3, 3, 2, 3, 3, 4, 2, 5, 2, 4, 3, 3, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 3, 2, 5, 2, 3, 3, 1, 3, 5, 2, 4, 3, 4, 2, 3, 2, 3, 3, 4, 3, 5, 2, 4, 2, 3, 2, 6, 3, 3, 3, 5, 2, 4, 3, 4, 3, 3, 3, 3, 2, 3, 4, 4
OFFSET
1,3
COMMENTS
a(n) = 1 if and only if n is a power of 2.
EXAMPLE
For n = 30 the divisors of 30 are [1, 2, 3, 5, 6, 10, 15, 30] and the largest odd noncomposite divisor is 5 and 5 is its 4th divisor, so a(30) = 4.
MATHEMATICA
a[n_] := Module[{m = n/2^IntegerExponent[n, 2]}, If[m == 1, 1, Position[Divisors[n], FactorInteger[m][[-1, 1]]][[1, 1]]]]; Array[a, 100] (* Amiram Eldar, May 29 2025 *)
CROSSREFS
Companion of A383401.
Right border of A384234.
Cf. A006005 (odd noncomposite numbers).
Sequence in context: A285200 A308567 A192099 * A193101 A100661 A088696
KEYWORD
nonn,easy
AUTHOR
Omar E. Pol, May 29 2025
STATUS
approved