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 A056872 #15 Oct 12 2023 08:56:24
%S A056872 1,5,25,42,133,618,643,701,1962,8150,147458,168459,356038,415870,
%T A056872 536685,637757,1093612,1207618,3368325,3470706,23400631,37621653
%N A056872 Numbers k such that k | p(k) + q(k) where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).
%C A056872 No other terms below 10^8. - _Max Alekseyev_, Oct 12 2023
%t A056872 Do[ If[ Mod[ PartitionsP[ n ] + PartitionsQ[ n ], n ] == 0, Print[ n ] ], {n, 1, 8150} ]
%Y A056872 Cf. A000009, A000041, A051177, A056848, A056873, A121919. A128836, A162468, A259943.
%K A056872 nonn,more
%O A056872 1,2
%A A056872 _Robert G. Wilson v_, Sep 02 2000
%E A056872 a(11)-a(18) from _Sean A. Irvine_, May 12 2022
%E A056872 a(19)-a(22) from _Max Alekseyev_, Oct 12 2023