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 A161242 #10 Feb 23 2019 16:55:23 %S A161242 0,0,1,1,1,2,1,2,3,3,3,6,5,6,9,8,9,14,12,14,19,19,21,28,26,30,37,38, %T A161242 41,53,50,56,68,69,74,91,88,98,115,118,125,150,149,163,188,192,204, %U A161242 239,239,260,293,303,322,367,372,400,444,462,487,548,557,597,657,682,718,795,812,868 %N A161242 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 3 times. %H A161242 R. H. Hardin, <a href="/A161242/b161242.txt">Table of n, a(n) for n=1..1000</a> %Y A161242 Cf. A001405. %K A161242 nonn %O A161242 1,6 %A A161242 _R. H. Hardin_, Jun 06 2009