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 A161251 #8 Feb 23 2019 16:59:28 %S A161251 0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2, %T A161251 1,4,2,4,4,5,4,7,5,7,7,8,7,11,9,11,12,13,12,16,14,16,17,18,17,22,19, %U A161251 22,23,24,23,28,25,28,29,30,29,36,32,36,38,40,40,48,45,50,53,56,57,67,65,71,75,79,81,92,91,98,103 %N A161251 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 12 times. %H A161251 R. H. Hardin, <a href="/A161251/b161251.txt">Table of n, a(n) for n=1..1000</a> %Y A161251 Cf. A001405. %K A161251 nonn %O A161251 1,24 %A A161251 _R. H. Hardin_, Jun 06 2009