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 A258480 #4 May 31 2015 12:44:50 %S A258480 1,12,79,377,1457,4836,14289,38493,96151,225486,501180,1063635, %T A258480 2168132,4265393,8130869,15067991,27222865,48062380,83093629, %U A258480 140925603,234830485,384989926,621737584,990119455,1556378360,2416887471,3710698393,5636503638,8476224739 %N A258480 Number of partitions of n into two sorts of parts having exactly 10 parts of the second sort. %H A258480 Alois P. Heinz, <a href="/A258480/b258480.txt">Table of n, a(n) for n = 10..1000</a> %p A258480 b:= proc(n, i) option remember; series(`if`(n=0, 1, %p A258480 `if`(i<1, 0, add(b(n-i*j, i-1)*add(x^t* %p A258480 binomial(j, t), t=0..min(10, j)), j=0..n/i))), x, 11) %p A258480 end: %p A258480 a:= n-> coeff(b(n$2), x, 10): %p A258480 seq(a(n), n=10..40); %Y A258480 Column k=10 of A256193. %K A258480 nonn %O A258480 10,2 %A A258480 _Alois P. Heinz_, May 31 2015