cp's OEIS Frontend

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.

A244173 Number of compositions of n in which the minimal multiplicity of parts equals 10.

This page as a plain text file.
%I A244173 #4 Jun 21 2014 17:03:14
%S A244173 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,184757,352716,999362,1144066,
%T A244173 2607902,3268760,6455801,8436285,15084366,20030010,33498532,44704881,
%U A244173 70470621,94057822,141525681,186848156,273268347,356766421,505886876,656919472
%N A244173 Number of compositions of n in which the minimal multiplicity of parts equals 10.
%H A244173 Alois P. Heinz, <a href="/A244173/b244173.txt">Table of n, a(n) for n = 10..400</a>
%p A244173 b:= proc(n, i, p, k) option remember; `if`(n=0, p!, `if`(i<1, 0,
%p A244173       add(b(n-i*j, i-1, p+j, k)/j!, j=[0, $max(1, k)..n/i])))
%p A244173     end:
%p A244173 a:= n-> b(n$2, 0, 10) -b(n$2, 0, 11):
%p A244173 seq(a(n), n=10..60);
%Y A244173 Column k=10 of A242451.
%K A244173 nonn
%O A244173 10,21
%A A244173 _Alois P. Heinz_, Jun 21 2014