|
|
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).
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|