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.

A244166 Number of compositions of n in which the minimal multiplicity of parts equals 3.

This page as a plain text file.
%I A244166 #4 Jun 21 2014 16:08:31
%S A244166 1,0,0,1,0,0,21,35,91,105,211,221,464,441,740,2571,5457,14740,37990,
%T A244166 89091,203487,416751,877183,1722277,3374384,6381902,12054327,22545335,
%U A244166 42054605,78409434,147669414,280480248,539039384,1051964654,2078682442,4165775779
%N A244166 Number of compositions of n in which the minimal multiplicity of parts equals 3.
%H A244166 Alois P. Heinz, <a href="/A244166/b244166.txt">Table of n, a(n) for n = 3..400</a>
%p A244166 b:= proc(n, i, p, k) option remember; `if`(n=0, p!, `if`(i<1, 0,
%p A244166       add(b(n-i*j, i-1, p+j, k)/j!, j=[0, $max(1, k)..n/i])))
%p A244166     end:
%p A244166 a:= n-> b(n$2, 0, 3) -b(n$2, 0, 4):
%p A244166 seq(a(n), n=3..50);
%Y A244166 Column k=3 of A242451.
%K A244166 nonn
%O A244166 3,7
%A A244166 _Alois P. Heinz_, Jun 21 2014