A077603 Least k >= 2 such that tau(n) divides tau(n^k), where tau(n) is the number of divisors of n, A000005.

2, 3, 3, 4, 3, 3, 3, 5, 4, 3, 3, 5, 3, 3, 3, 6, 3, 5, 3, 5, 3, 3, 3, 3, 4, 3, 5, 5, 3, 3, 3, 7, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 5, 5, 3, 3, 9, 4, 5, 3, 5, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 5, 8, 3, 3, 3, 5, 3, 3, 3, 13, 3, 3, 5, 5, 3, 3, 3, 9, 6, 3, 3, 5, 3, 3, 3, 3, 3, 5, 3, 5, 3, 3, 3, 5, 3, 5, 5, 4, 3, 3, 3, 3

Offset

1,1

Links

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

Prog

(PARI) A077603(n) = { my(k=2, nd=numdiv(n)); while((numdiv(n^k)%nd), k=k+1); k; } \\ Antti Karttunen, May 28 2017

Crossrefs

Cf. A000005.

Sequence in context: A007554 A139069 A071866 * A077567 A096344 A030349

Adjacent sequences: A077600 A077601 A077602 * A077604 A077605 A077606

Keyword

nonn

Author

Benoit Cloitre, Dec 01 2002

Status

approved