|
%I #15 Mar 15 2020 21:02:30
%S 1,0,1,0,1,0,2,0,3,0,3,1,4,1,5,1,6,2,7,3,8,3,10,4,12,5,13,6,15,7,18,8,
%T 20,10,22,12,25,13,28,15,31,18,34,20,38,22,42,25,46,28,50,31,55,34,60,
%U 38,65,42,70,46,76,50,82,55,88,60,95,65,102,70
%N Expansion of 1/((1-x^2)*(1-x^6)*(1-x^8)*(1-x^11)).
%C Gives the number of ways one can write n as the sum of the numbers 2, 6, 8 and 11 if the order of the summands is irrelevant. - _Stefan Steinerberger_, Apr 09 2006
%C In other words, number of partitions of n into parts 2, 6, 8, and 11. - _Joerg Arndt_, Jun 02 2014
%H Vincenzo Librandi, <a href="/A029220/b029220.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_27">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,0,0,0,1,0,0,0,-1,1,0,-1,-1,0,1,-1,0,0,0,1,0,0,0,1,0,-1).
%t CoefficientList[Series[1/((1-x^2)(1-x^6)(1-x^8)(1-x^11)), {x, 0, 100}], x] (* _Stefan Steinerberger_, Apr 09 2006 *)
%o (PARI) Vec(1/((1-x^2)*(1-x^6)*(1-x^8)*(1-x^11)) + O(x^80)) \\ _Jinyuan Wang_, Mar 15 2020
%K nonn,easy
%O 0,7
%A _N. J. A. Sloane_
%E More terms from _Stefan Steinerberger_, Apr 09 2006
|
