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 A161252 #9 Feb 23 2019 18:48:06 %S A161252 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 A161252 1,2,1,2,3,3,3,5,4,5,6,6,6,8,7,8,9,10,10,12,12,13,14,15,15,17,17,18, %U A161252 19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,36,36,38,40,42,44,48,49,52,55,58,61,66,69,73,77,81,85,91 %N A161252 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 13 times. %H A161252 R. H. Hardin, <a href="/A161252/b161252.txt">Table of n, a(n) for n=1..1000</a> %Y A161252 Cf. A001405. %K A161252 nonn %O A161252 1,26 %A A161252 _R. H. Hardin_, Jun 06 2009