The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A288165 Expansion of x^4/((1-x^4)*(1-x^3)*(1-x^6)*(1-x^9)). 3

%I #20 Jan 07 2018 23:59:49

%S 0,0,0,0,1,0,0,1,1,0,2,1,1,3,2,1,5,3,2,6,5,3,9,6,5,11,9,6,15,11,9,18,

%T 15,11,23,18,15,27,23,18,34,27,23,39,34,27,47,39,34,54,47,39,64,54,47,

%U 72,64,54,84,72,64,94,84,72,108,94,84,120,108,94,136,120

%N Expansion of x^4/((1-x^4)*(1-x^3)*(1-x^6)*(1-x^9)).

%H Seiichi Manyama, <a href="/A288165/b288165.txt">Table of n, a(n) for n = 0..10000</a>

%H Daniel Panario, Murat Sahin and Qiang Wang, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i4p55/pdf">Generalized Alcuin’s Sequence</a>, The Electronic Journal of Combinatorics, Volume 19, Issue 4 (2012).

%H <a href="/index/Rec#order_22">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 1, 1, 0, 1, -1, 0, 0, -1, 0, -1, 0, 0, -1, 1, 0, 1, 1, 0, 0, -1).

%F a(n) = p_4(n/3) if n == 0 mod 3,

%F a(n) = p_4((n+8)/3) if n == 1 mod 3,

%F a(n) = p_4((n+4)/3) if n == 2 mod 3,

%F where p_4(n) is the number of partitions of n into exactly 4 parts.

%e a(57) = p_4(57/3) = p_4(19) = A001400(15) = 54,

%e a(58) = p_4((58+8)/3) = p_4(22) = A001400(18) = 84,

%e a(59) = p_4((59+4)/3) = p_4(21) = A001400(17) = 72,

%e a(60) = p_4(60/3) = p_4(20) = A001400(16) = 64,

%e a(61) = p_4((61+8)/3) = p_4(23) = A001400(19) = 94,

%e a(62) = p_4((62+4)/3) = p_4(22) = A001400(18) = 84.

%Y Cf. A001400, A029253.

%Y Cf. A005044 (k=3), this sequence (k=4), A288166 (k=5).

%K nonn,easy

%O 0,11

%A _Seiichi Manyama_, Jun 06 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 02:51 EDT 2024. Contains 373089 sequences. (Running on oeis4.)