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 A025160 #10 May 10 2013 12:44:04 %S A025160 1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,9,10,11,13,14,16,18,20,22,25, %T A025160 27,30,33,36,39,43,46,50,54,59,63,69,74,81,87,95,102,112,120,131,141, %U A025160 154,165,180,193,210,225,244,261,283,302,326,348,375,400,430,458,492 %N A025160 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 6. %H A025160 Alois P. Heinz, <a href="/A025160/b025160.txt">Table of n, a(n) for n = 1..1000</a> %F A025160 G.f.: Sum(x^(3*k^2-2*k)/Product(1-x^i, i=1..k), k=1..infinity). - _Vladeta Jovovic_, Aug 12 2004 %Y A025160 Cf. A003114, A025157-A025162. %Y A025160 Column k=6 of A194543. %K A025160 nonn %O A025160 1,8 %A A025160 _Clark Kimberling_ %E A025160 More terms from _Vladeta Jovovic_, Aug 12 2004