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 A161250 #8 Feb 23 2019 16:58:23 %S A161250 0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2,3,3, %T A161250 3,5,4,5,6,6,6,8,7,9,10,10,11,13,12,14,15,15,16,18,18,19,21,21,22,24, %U A161250 24,25,27,27,28,32,31,33,36,37,39,44,44,47,51,53,57,63,64,68,73,76,81,88,90,95,101,106,111,120 %N A161250 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 11 times. %H A161250 R. H. Hardin, <a href="/A161250/b161250.txt">Table of n, a(n) for n=1..1000</a> %Y A161250 Cf. A001405. %K A161250 nonn %O A161250 1,22 %A A161250 _R. H. Hardin_, Jun 06 2009