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 A161249 #12 Jun 28 2019 10:52:16 %S A161249 0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,4,2,4,4,5, %T A161249 4,7,5,7,7,9,8,11,10,12,12,14,13,16,15,18,17,20,19,22,21,24,23,26,25, %U A161249 30,28,32,32,36,36,42,41,46,47,53,54,61,61,67,69,76,78,86,87,95,97,106,108,118,119,129,131,142 %N A161249 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 10 times. %H A161249 R. H. Hardin, <a href="/A161249/b161249.txt">Table of n, a(n) for n=1..1000</a> %Y A161249 Cf. A001405. %K A161249 nonn %O A161249 1,20 %A A161249 _R. H. Hardin_, Jun 06 2009