A336650 a(n) = p^e, where p is the smallest odd prime factor of n, and e is its exponent, with a(n) = 1 when n is a power of two.

1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 11, 3, 13, 7, 3, 1, 17, 9, 19, 5, 3, 11, 23, 3, 25, 13, 27, 7, 29, 3, 31, 1, 3, 17, 5, 9, 37, 19, 3, 5, 41, 3, 43, 11, 9, 23, 47, 3, 49, 25, 3, 13, 53, 27, 5, 7, 3, 29, 59, 3, 61, 31, 9, 1, 5, 3, 67, 17, 3, 5, 71, 9, 73, 37, 3, 19, 7, 3, 79, 5, 81, 41, 83, 3, 5, 43, 3, 11, 89, 9, 7, 23, 3

Offset

1,3

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Formula

a(n) = A028233(A000265(n)).

Prog

(PARI) A336650(n) = if(!bitand(n, n-1), 1, my(f=factor(n>>valuation(n, 2))); f[1, 1]^f[1, 2]);

Crossrefs

Cf. A000265, A028233, A078701, A336362.

Sequence in context: A244568 A331471 A325401 * A343249 A327656 A098985

Adjacent sequences: A336647 A336648 A336649 * A336651 A336652 A336653

Keyword

nonn

Author

Antti Karttunen, Jul 30 2020

Status

approved