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 A227565 #7 Feb 09 2016 11:48:53 %S A227565 1,1,3,5,9,13,21,29,43,60,84,113,156,201,266,346,443,558,709,877,1091, %T A227565 1343,1643,1994,2423,2898,3470,4139,4897,5773,6800,7940,9266,10779, %U A227565 12466,14393,16590,19009,21756,24847,28253,32073,36354,41035,46275,52088,58430 %N A227565 Number of partitions of n into distinct parts with boundary size 8. %C A227565 The boundary size is the number of parts having fewer than two neighbors. %H A227565 Alois P. Heinz, <a href="/A227565/b227565.txt">Table of n, a(n) for n = 48..1000</a> %Y A227565 Column k=8 of A227345, A227551. %K A227565 nonn %O A227565 48,3 %A A227565 _Alois P. Heinz_, Jul 16 2013