A346708 a(n) is the least k > 1 such that p(n) divides p(n^k), or 0 if no such k exists (p = A000041).

2, 3, 2, 3, 3, 6, 7, 2, 10

Offset

1,1

Links

Table of n, a(n) for n=1..9.

Example

a(8) = 2 because p(8) = 22 divides p(8^2) = 1741630.

Mathematica

a[n_] := Module[{k = 2, p = PartitionsP[n]}, While[! Divisible[PartitionsP[n^k], p], k++]; k]; Array[a, 9] (* Amiram Eldar, Aug 04 2021 *)

Prog

(PARI) a(n)=my(t=2); while(numbpart(n^t)%numbpart(n), t++); t

Crossrefs

Cf. A000041.

Sequence in context: A003051 A377774 A305866 * A328406 A257396 A293519

Adjacent sequences: A346705 A346706 A346707 * A346709 A346710 A346711

Keyword

nonn,hard,more

Author

Altug Alkan, Jul 30 2021

Status

approved