|
%I #27 Sep 08 2022 08:46:25
%S 0,0,0,0,0,0,0,2,2,4,5,8,10,14,16,22,26,32,37,46,52,62,70,82,92,106,
%T 117,134,148,166,182,204,222,246,267,294,318,348,374,408,438,474,507,
%U 548,584,628,668,716,760,812,859,916,968,1028,1084,1150,1210,1280,1345,1420
%N Number of 1-complete partitions of n with largest part 4.
%H Colin Barker, <a href="/A331443/b331443.txt">Table of n, a(n) for n = 0..1000</a>
%H Seung Kyung Park, <a href="https://doi.org/10.1016/S0012-365X(97)00177-5">The r-complete partitions</a>, Discrete mathematics 183.1-3 (1998): 293-297.
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,0,-2,0,0,1,1,-1).
%F G.f.: q^5/qd(4)-q^5/((1-q^4)*(1-q^3))-q^6/(1-q^4) where qd(k) = Product_{i=1..k} (1-q^i).
%F a(n) = a(n-1) + a(n-2) - 2*a(n-5) + a(n-8) + a(n-9) - a(n-10). - _Colin Barker_, Jan 27 2020
%t LinearRecurrence[{1, 1, 0, 0, -2, 0, 0, 1, 1, -1}, {0, 0, 0, 0, 0, 0, 0, 2, 2, 4, 5, 8, 10}, 60] (* _Vincenzo Librandi_, Jan 28 2020 *)
%o concat([0,0,0,0,0,0,0], Vec(x^7*(2 - x^3 - x^4 + x^5) / ((1 - x)^4*(1 + x)^2*(1 + x^2)*(1 + x + x^2)) + O(x^60))) \\ _Colin Barker_, Jan 27 2020
%o (Magma) I:=[0,0,0,0,0,0,0,2,2,4,5,8,10]; [n le 13 select I[n] else Self(n-1) + Self(n-2) - 2*Self(n-5) + Self(n-8) + Self(n-9) - Self(n-10): n in [1..60]]; // _Vincenzo Librandi_, Jan 28 2020
%Y Cf. A331444.
%K nonn,easy
%O 0,8
%A _N. J. A. Sloane_, Jan 22 2020
|
