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 A258479 #4 May 31 2015 11:50:29 %S A258479 1,11,67,298,1080,3379,9453,24204,57658,129335,275693,562454,1104484, %T A258479 2097247,3865383,6937016,12154390,20838939,35029203,57829458,93897437, %U A258479 150150058,236723504,368350864,566187387,860416074,1293614426,1925547270,2839214222,4149449828 %N A258479 Number of partitions of n into two sorts of parts having exactly 9 parts of the second sort. %H A258479 Alois P. Heinz, <a href="/A258479/b258479.txt">Table of n, a(n) for n = 9..1000</a> %p A258479 b:= proc(n, i) option remember; series(`if`(n=0, 1, %p A258479 `if`(i<1, 0, add(b(n-i*j, i-1)*add(x^t* %p A258479 binomial(j, t), t=0..min(9, j)), j=0..n/i))), x, 10) %p A258479 end: %p A258479 a:= n-> coeff(b(n$2), x, 9): %p A258479 seq(a(n), n=9..40); %Y A258479 Column k=9 of A256193. %K A258479 nonn %O A258479 9,2 %A A258479 _Alois P. Heinz_, May 31 2015