A346708 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

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

(list; graph; refs; listen; history; text; internal format)

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

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