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 A161263 #9 Sep 03 2025 15:15:46 %S A161263 0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,3,2,4,3,5, %T A161263 4,6,5,7,6,9,7,9,8,11,9,11,10,13,11,14,13,16,14,17,16,19,17,20,19,23, %U A161263 20,24,22,27,23,28,25,31,26,34,29,37,31,40,35,45,39,49,43,56,48,61,54,69,59,74,67,83,73,91,82 %N A161263 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 10 times. %H A161263 R. H. Hardin, <a href="/A161263/b161263.txt">Table of n, a(n) for n=1..1000</a> %K A161263 nonn,changed %O A161263 1,20 %A A161263 _R. H. Hardin_, Jun 06 2009