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 A161255 #6 Sep 25 2023 22:52:29 %S A161255 0,1,1,2,1,3,2,5,3,6,5,9,6,12,9,16,12,20,16,26,21,33,27,41,35,50,43, %T A161255 62,54,75,66,91,82,108,99,131,120,154,144,183,172,214,204,254,240,294, %U A161255 284,344,331,398,387,462,449,531,521,612,600,702,690,803,792,915,905,1043 %N A161255 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 2 times. %H A161255 R. H. Hardin, <a href="/A161255/b161255.txt">Table of n, a(n) for n=1..1000</a> %Y A161255 Cf. A000124. %K A161255 nonn %O A161255 1,4 %A A161255 _R. H. Hardin_, Jun 06 2009