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 A161266 #6 Jul 22 2025 06:36:29 %S A161266 0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2, %T A161266 1,2,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,10,9,10,10,12,11,12,12,14,13,14,14, %U A161266 16,16,17,17,19,19,20,20,22,22,23,23,25,25,27,26,29,28,31,29,33,31,35,32,37,34,39,37,42,39,45,42,49 %N A161266 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 13 times. %H A161266 R. H. Hardin, <a href="/A161266/b161266.txt">Table of n, a(n) for n=1..1000</a> %K A161266 nonn %O A161266 1,26 %A A161266 _R. H. Hardin_ Jun 06 2009