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 A227566 #7 Feb 09 2016 11:48:39 %S A227566 1,2,3,6,10,15,24,35,50,71,99,134,184,246,321,424,547,699,891,1123, %T A227566 1400,1751,2158,2648,3239,3938,4751,5732,6857,8174,9721,11501,13535, %U A227566 15924,18622,21728,25278,29320,33873,39102,44939,51542,58995,67348,76654,87161 %N A227566 Number of partitions of n into distinct parts with boundary size 9. %C A227566 The boundary size is the number of parts having fewer than two neighbors. %H A227566 Alois P. Heinz, <a href="/A227566/b227566.txt">Table of n, a(n) for n = 61..1000</a> %Y A227566 Column k=9 of A227345, A227551. %K A227566 nonn %O A227566 61,2 %A A227566 _Alois P. Heinz_, Jul 16 2013