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.

A241868 Number of compositions of n such that the smallest part has multiplicity eight.

This page as a plain text file.
%I A241868 #10 Feb 09 2015 09:29:16
%S A241868 1,0,9,9,54,99,309,684,1720,3909,9036,20178,44676,97191,209151,444498,
%T A241868 935002,1947729,4021429,8234244,16732173,33758283,67656843,134751630,
%U A241868 266817214,525411981,1029271671,2006453683,3893241810,7521104292,14468931402,27724579185
%N A241868 Number of compositions of n such that the smallest part has multiplicity eight.
%H A241868 Joerg Arndt and Alois P. Heinz, <a href="/A241868/b241868.txt">Table of n, a(n) for n = 8..1000</a>
%F A241868 a(n) ~ n^8 * ((1+sqrt(5))/2)^(n-17) / (5^(9/2) * 8!). - _Vaclav Kotesovec_, May 02 2014
%p A241868 b:= proc(n, s) option remember; `if`(n=0, 1,
%p A241868       `if`(n<s, 0, expand(add(b(n-j, s)*x, j=s..n))))
%p A241868     end:
%p A241868 a:= proc(n) local k; k:= 8;
%p A241868       add((p->add(coeff(p, x, i)*binomial(i+k, k),
%p A241868        i=0..degree(p)))(b(n-j*k, j+1)), j=1..n/k)
%p A241868     end:
%p A241868 seq(a(n), n=8..40);
%t A241868 b[n_, s_] := b[n, s] = If[n == 0, 1, If[n < s, 0, Expand[Sum[b[n - j, s]*x, {j, s, n}]]]]; a[n_] := With[{k = 8}, Sum[Function[{p}, Sum[Coefficient[p, x, i]*Binomial[i + k, k], {i, 0, Exponent[p, x]}]][b[n - j*k, j + 1]], {j, 1, n/k}]]; Table[a[n], {n, 8, 40}] (* _Jean-François Alcover_, Feb 09 2015, after Maple *)
%Y A241868 Column k=8 of A238342.
%K A241868 nonn
%O A241868 8,3
%A A241868 _Joerg Arndt_ and _Alois P. Heinz_, Apr 30 2014