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 A205301 #15 Mar 31 2012 10:28:36 %S A205301 1312,1501,2446,2776,4381,3676,4951,6541,5686,7771,8326,7696,8011, %T A205301 10471,9256,9871,11041,11626,15256,12751,15511,15151,14956,19441, %U A205301 16801,20596,20101,22291,17611,17341,18451,21856,19051,21226,23761,20842,24796,22651,22546 %N A205301 Last occurrence of n partitions in A204814. %C A205301 Conjectured lower bound to be increasing for increasing n. %C A205301 Related to Goldbach's conjecture. %H A205301 Donovan Johnson, <a href="/A205301/b205301.txt">Table of n, a(n) for n = 0..1000</a> (from search done for first 25*10^6 terms in A204814) %e A205301 1312 is the last observed 0 so for n=0, a(0)=1312. %Y A205301 Cf. A104272, A173634, A204814. %K A205301 nonn %O A205301 0,1 %A A205301 _John W. Nicholson_, Jan 27 2012 %E A205301 a(10)-a(38) from _Donovan Johnson_, Jan 28 2012