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 A025162 #11 May 10 2013 12:44:04 %S A025162 1,1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,11,12,13,15,16, %T A025162 18,20,22,24,27,29,32,35,38,41,45,48,52,56,60,64,69,73,78,83,89,94, %U A025162 101,107,115,122,131,139,150,159,171,182,196,208,224,238,256,272,292,310 %N A025162 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 8. %H A025162 Alois P. Heinz, <a href="/A025162/b025162.txt">Table of n, a(n) for n = 1..1000</a> %F A025162 G.f.: Sum(x^(4*k^2-3*k)/Product(1-x^i, i=1..k), k=1..infinity). - _Vladeta Jovovic_, Aug 12 2004 %Y A025162 Cf. A003114, A025157-A025162. %Y A025162 Column k=8 of A194543. %K A025162 nonn %O A025162 1,10 %A A025162 _Clark Kimberling_ %E A025162 More terms from _Naohiro Nomoto_, Feb 27 2002