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 A161262 #6 Jul 22 2025 06:36:01 %S A161262 0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,2,3,3,4,4,5,5,6, %T A161262 6,8,7,8,8,10,9,10,10,12,12,13,13,15,15,16,16,18,18,20,19,22,21,24,22, %U A161262 26,24,28,27,31,29,34,32,38,36,43,40,48,46,53,51,59,58,65,64,73,72,80,79,89,87,97,96,107,105 %N A161262 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 9 times. %H A161262 R. H. Hardin, <a href="/A161262/b161262.txt">Table of n, a(n) for n=1..1000</a> %K A161262 nonn %O A161262 1,18 %A A161262 _R. H. Hardin_ Jun 06 2009