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 A302752 #9 Oct 03 2023 15:48:00 %S A302752 1,3,4,5,11,197,487,928,10995,19318 %N A302752 Numbers k such that k divides the sum of largest parts of all partitions of k. %C A302752 Numbers k such that k divides the total number of parts in all partitions of k. %C A302752 Next term, if it exists, is greater than 100000. - _Vaclav Kotesovec_, May 04 2018 %e A302752 5 is in the sequence because we have [5], [4, 1], [3, 2], [3, 1, 1], [2, 2, 1], [2, 1, 1, 1], [1, 1, 1, 1, 1] and 5 + 4 + 3 + 3 + 2 + 2 + 1 = 20 is divisible by 5. %t A302752 Select[Range[200],Mod[Total[IntegerPartitions[#][[;;,1]]],#]==0&] (* The program generates the first six terms of the sequence. *) (* _Harvey P. Dale_, Oct 03 2023 *) %Y A302752 Cf. A006128, A051177. %K A302752 nonn,more %O A302752 1,2 %A A302752 _Ilya Gutkovskiy_, Apr 12 2018