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 A227567 #7 Feb 09 2016 11:48:10 %S A227567 1,1,3,5,9,14,23,32,49,69,98,134,186,247,334,440,574,742,962,1218, %T A227567 1549,1943,2430,3011,3728,4564,5590,6795,8227,9909,11914,14223,16954, %U A227567 20124,23795,28044,32974,38592,45093,52530,60991,70640,81667,94095,108214,124177 %N A227567 Number of partitions of n into distinct parts with boundary size 10. %C A227567 The boundary size is the number of parts having fewer than two neighbors. %H A227567 Alois P. Heinz, <a href="/A227567/b227567.txt">Table of n, a(n) for n = 75..1000</a> %Y A227567 Column k=10 of A227345, A227551. %K A227567 nonn %O A227567 75,3 %A A227567 _Alois P. Heinz_, Jul 16 2013