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 A227559 #9 Feb 09 2016 11:47:27 %S A227559 1,1,2,3,3,3,5,5,5,6,6,7,9,7,8,10,9,10,12,11,11,12,13,13,15,14,14,17, %T A227559 15,15,18,17,19,19,18,19,21,20,20,23,21,22,26,23,23,24,25,26,27,26,26, %U A227559 29,29,28,30,29,29,32,30,31,35,31,34,35,33,34,36,37,35 %N A227559 Number of partitions of n into distinct parts with boundary size 2. %C A227559 The boundary size is the number of parts having fewer than two neighbors. %H A227559 Alois P. Heinz, <a href="/A227559/b227559.txt">Table of n, a(n) for n = 3..1000</a> %Y A227559 Column k=2 of A227345, A227551. %K A227559 nonn %O A227559 3,3 %A A227559 _Alois P. Heinz_, Jul 16 2013