A286627 a(n) = exponent of the highest power of A000005(n) (number of divisors of n) dividing A000010(n) (totient function phi), a(1) = 1.

1, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 2, 0, 1, 0, 4, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 2, 1, 1, 0, 1, 2, 1, 0, 2, 0, 1, 1, 3, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 1, 1, 1, 1, 0, 2, 0, 2, 0, 2, 0, 1, 0, 1, 1, 1, 1, 3, 1, 0, 2, 1, 1, 1, 0, 0, 1, 1, 1, 3, 0, 1, 1, 3, 1, 1, 0, 1, 0, 1, 0, 5, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 4, 0, 1, 0, 2, 0, 2, 1, 0

Offset: 1

Author

Antti Karttunen, Jun 30 2017

Keywords

• nonn

Comments

a(1) = 1 by convention.

Examples

			A000005(5) = 2, A000010(5) = 4, 2^2 is the highest power of 2 which divides 4, thus a(5) = 2.
A000005(6) = 4, A000010(6) = 2, 4^0 = 1 is the highest power of 4 which divides 2, thus a(6) = 0.
		

Links

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

Crossrefs

Cf. A000005, A000010, A286561, A286628, A289276.

Cf. A015733 (positions of zeros), A020491 (of nonzeros).

Programs

PARI

A286627(n) = valuation(eulerphi(n), numdiv(n));

Formula

a(n) = A286561(A000010(n), A000005(n)).