This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A346708 #18 Aug 06 2021 04:45:34
%S A346708 2,3,2,3,3,6,7,2,10
%N 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).
%e A346708 a(8) = 2 because p(8) = 22 divides p(8^2) = 1741630.
%t A346708 a[n_] := Module[{k = 2, p = PartitionsP[n]}, While[! Divisible[PartitionsP[n^k], p], k++]; k]; Array[a, 9] (* _Amiram Eldar_, Aug 04 2021 *)
%o A346708 (PARI) a(n)=my(t=2); while(numbpart(n^t)%numbpart(n), t++); t
%Y A346708 Cf. A000041.
%K A346708 nonn,hard,more
%O A346708 1,1
%A A346708 _Altug Alkan_, Jul 30 2021