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 A258478 #4 May 31 2015 11:30:57 %S A258478 1,10,56,231,782,2299,6074,14751,33454,71676,146357,286749,542017, %T A258478 992683,1768044,3071242,5216904,8682987,14188324,22794857,36061113, %U A258478 56235914,86551836,131580012,197774522,294103819,433033550,631622692,913255789,1309504156,1863113073 %N A258478 Number of partitions of n into two sorts of parts having exactly 8 parts of the second sort. %H A258478 Alois P. Heinz, <a href="/A258478/b258478.txt">Table of n, a(n) for n = 8..1000</a> %p A258478 b:= proc(n, i) option remember; series(`if`(n=0, 1, %p A258478 `if`(i<1, 0, add(b(n-i*j, i-1)*add(x^t* %p A258478 binomial(j, t), t=0..min(8, j)), j=0..n/i))), x, 9) %p A258478 end: %p A258478 a:= n-> coeff(b(n$2), x, 8): %p A258478 seq(a(n), n=8..40); %Y A258478 Column k=8 of A256193. %K A258478 nonn %O A258478 8,2 %A A258478 _Alois P. Heinz_, May 31 2015