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 A161256 #6 Jul 22 2025 06:35:20 %S A161256 0,0,1,1,1,2,1,2,2,3,3,5,4,5,6,8,7,9,9,12,12,14,14,19,18,22,23,28,27, %T A161256 32,34,40,42,47,48,57,58,66,69,78,81,89,94,106,111,120,128,143,148, %U A161256 161,170,187,196,214,225,244,257,277,294,319,335,357,377,409,428,460,483,519,546,582 %N A161256 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 3 times. %H A161256 R. H. Hardin, <a href="/A161256/b161256.txt">Table of n, a(n) for n=1..1000</a> %K A161256 nonn %O A161256 1,6 %A A161256 _R. H. Hardin_ Jun 06 2009