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 A025161 #11 May 10 2013 12:44:04 %S A025161 1,1,1,1,1,1,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,10,11,12,14,15,17,19, %T A025161 21,23,26,28,31,34,37,40,44,47,51,55,59,63,68,73,78,84,90,97,104,112, %U A025161 120,130,139,150,161,174,186,201,215,232,248,267,285,307,327,351,374,401 %N A025161 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 7. %H A025161 Alois P. Heinz, <a href="/A025161/b025161.txt">Table of n, a(n) for n = 1..1000</a> %F A025161 G.f.: Sum(x^(7/2*k^2-5/2*k)/Product(1-x^i, i=1..k), k=1..infinity). - _Vladeta Jovovic_, Aug 12 2004 %Y A025161 Cf. A003114, A025157-A025162. %Y A025161 Column k=7 of A194543. %K A025161 nonn %O A025161 1,9 %A A025161 _Clark Kimberling_ %E A025161 More terms from _Naohiro Nomoto_, Feb 27 2002