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 A161265 #6 Jul 22 2025 06:36:22 %S A161265 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2, %T A161265 1,3,2,4,3,5,4,6,5,7,6,8,7,10,8,10,9,12,10,12,11,14,12,14,13,17,15,17, %U A161265 16,20,18,20,19,23,21,23,22,27,24,27,25,31,27,31,28,35,30,35,31,41,34,41,36,47,40,49,44,56,48,59,52 %N A161265 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 12 times. %H A161265 R. H. Hardin, <a href="/A161265/b161265.txt">Table of n, a(n) for n=1..1000</a> %K A161265 nonn %O A161265 1,24 %A A161265 _R. H. Hardin_ Jun 06 2009