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 A118365 #3 Mar 30 2012 17:26:53 %S A118365 0,1,3,9,28,88 %N A118365 Limiting difference of the number of infinity-dimensional partitions and m-dimensional partitions of m+n as m tends to infinity. %F A118365 a(n)=A119268(m+n)-A119269(m+n,m)=A119268(m+n)-A119338(m,m+n) for all m>=2n-8. Partial sums of A118364. %Y A118365 Cf. A119269, A119338, A119268. %K A118365 hard,more,nonn %O A118365 2,3 %A A118365 _Max Alekseyev_, May 17 2006