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 A161261 #6 Jul 22 2025 06:35:55 %S A161261 0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,3,2,4,3,5,4,6,5,8,6,8, %T A161261 7,10,8,10,9,13,11,13,12,16,14,16,15,20,17,20,18,24,20,24,21,30,24,30, %U A161261 26,36,30,38,34,46,39,49,43,57,49,62,55,72,62,77,68,87,77,94,85,106,95,114,104,128,116,138 %N A161261 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 8 times. %H A161261 R. H. Hardin, <a href="/A161261/b161261.txt">Table of n, a(n) for n=1..1000</a> %K A161261 nonn %O A161261 1,16 %A A161261 _R. H. Hardin_ Jun 06 2009