A074358
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n-2))*nu(n-2) with (b,lambda)=(2,2).
Original entry on oeis.org
0, 0, 0, 4, 20, 80, 288, 976, 3184, 10112, 31488, 96576, 292672, 878336, 2614784, 7731456, 22728448, 66482176, 193617920, 561718272, 1624101888, 4681535488, 13457924096, 38592008192, 110419341312, 315287830528, 898583560192
Offset: 0
Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
The first 6 nu polynomials are nu(0)=1, nu(1)=2, nu(2)=6, nu(3) = 16 + 4q, nu(4) = 44 + 20q + 12q^2, nu(5) = 120 + 80q + 64q^2 + 40q^3 + 8q^4, so the coefficients of q^1 are 0,0,0,4,20,80.
-
nu := proc(b,lambda,n) global q; local qp,i ; if n = 0 then RETURN(1) ; elif n =1 then RETURN(b) ; fi ; qp:=0 ; for i from 0 to n-2 do qp := qp + q^i ; od ; RETURN( b*nu(b,lambda,n-1)+lambda*qp*nu(b,lambda,n-2)) ; end: A074358 := proc(n) RETURN( coeftayl(nu(2,2,n),q=0,1) ) ; end: for n from 0 to 30 do printf("%d,", A074358(n)) ; od ; # R. J. Mathar, Sep 20 2006
-
nu[0] = 1; nu[1] = 2; nu[n_] := nu[n] = 2*nu[n-1] + 2*Total[q^Range[0, n-2] ]*nu[n-2] // Expand;
a[n_] := Coefficient[nu[n], q, 1];
Table[a[n], {n, 0, 26}] (* Jean-François Alcover, Nov 17 2017 *)
A074360
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).
Original entry on oeis.org
0, 0, 0, 0, 0, 40, 232, 1072, 4400, 16864, 61728, 218496, 753792, 2547840, 8468608, 27755776, 89886976, 288101888, 915089920, 2883416064, 9021001728, 28042881024, 86672025600, 266472878080, 815347462144, 2483820617728
Offset: 0
Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
The first 6 nu polynomials are nu(0)=1, nu(1)=2, nu(2)=6, nu(3)=16+4q, nu(4)=44+20q+12q^2, nu(5)=120+80q+64q^2+40q^3+8q^4, so the coefficients of q^1 are 0,0,0,0,0,40.
-
nu := proc(b,lambda,n) global q; local qp,i ; if n = 0 then RETURN(1) ; elif n =1 then RETURN(b) ; fi ; qp:=0 ; for i from 0 to n-2 do qp := qp + q^i ; od ; RETURN( b*nu(b,lambda,n-1)+lambda*qp*nu(b,lambda,n-2)) ; end: A074360 := proc(n) RETURN( coeftayl(nu(2,2,n),q=0,3) ) ; end: for n from 0 to 30 do printf("%d,", A074360(n)) ; od ; # R. J. Mathar, Sep 20 2006
-
nu[0] = 1; nu[1] = 2; nu[n_] := nu[n] = 2*nu[n - 1] + 2*Total[q^Range[0, n - 2]]*nu[n - 2] // Expand;
a[n_] := Coefficient[nu[n], q, 3];
Table[a[n], {n, 0, 25}] (* Jean-François Alcover, Nov 18 2017 *)
A074355
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).
Original entry on oeis.org
0, 0, 0, 3, 15, 45, 147, 402, 1134, 2991, 7917, 20367, 52167, 131748, 330876, 824187, 2042763, 5035473, 12361755, 30226614, 73664298, 178971879, 433649769, 1048133619, 2527706127, 6083434824, 14613750648, 35045236083, 83909261319
Offset: 0
Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
The first 6 nu polynomials are nu(0)=1, nu(1)=1, nu(2)=4, nu(3)=7+3q, nu(4)=19+15q+12q^2, nu(5)=40+45q+42q^2+30q^3+9q^4, so the coefficients of q^1 are 0,0,0,3,15,45.
-
nu := proc(n,b,lambda) option remember ; if n = 0 then 1 ; elif n = 1 then b ; else b*nu(n-1,b,lambda)+lambda*nu(n-2,b,lambda)*add(q^i,i=0..n-2) ; fi ; end:
A074355 := proc(n) local b,lambda,thisnu ; b := 1 ; lambda := 3 ; thisnu := nu(n,b,lambda) ; RETURN( coeftayl(thisnu,q=0,1) ) ; end: # R. J. Mathar, Mar 20 2007
-
nu[n_, b_, lambda_] := nu[n, b, lambda] = Which[ n == 0, 1, n == 1, b, True, b*nu[n - 1, b, lambda] + lambda*nu[n - 2, b, lambda]*Sum[q^i, {i, 0, n - 2}]];
a[n_] := a[n] = Coefficient[nu[n, 1, 3], q, 1];
Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 30}] (* Jean-François Alcover, Nov 23 2017, from 1st Maple program *)
A074356
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,3).
Original entry on oeis.org
0, 0, 0, 0, 12, 42, 180, 561, 1833, 5373, 15798, 44367, 123561, 336243, 906054, 2408094, 6344832, 16561824, 42922602, 110472933, 282678423, 719404803, 1822117962, 4594816221, 11540742615, 28880919975, 72033463644, 179107709004
Offset: 0
Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
The first 6 nu polynomials are nu(0)=1, nu(1)=1, nu(2)=4, nu(3)=7+3q, nu(4)=19+15q+12q^2, nu(5)=40+45q+42q^2+30q^3+9q^4, so the coefficients of q^2 are 0,0,0,0,12,42.
-
nu := proc(n,b,lambda) if n = 0 then 1 ; elif n = 1 then b ; else b*nu(n-1,b,lambda)+lambda*nu(n-2,b,lambda)*add(q^i,i=0..n-2) ; fi ; end: A074356 := proc(n) local b,lambda,thisnu ; b := 1 ; lambda := 3 ; thisnu := nu(n,b,lambda) ; RETURN( coeftayl(thisnu,q=0,2) ) ; end: for n from 0 to 40 do printf("%d, ",A074356(n) ) ; od ; # R. J. Mathar, Mar 20 2007
-
nu[n_, b_, lambda_] := nu[n, b, lambda] = Which[n == 0, 1, n == 1, b, True, b*nu[n - 1, b, lambda] + lambda*nu[n - 2, b, lambda]*Sum[q^i, {i, 0, n - 2}]];
a[n_] := a[n] = Coefficient[nu[n, 1, 3], q, 2];
Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 30}] (* Jean-François Alcover, Nov 23 2017, from Maple *)
A074359
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,2).
Original entry on oeis.org
0, 0, 0, 0, 12, 64, 280, 1088, 3968, 13856, 46912, 155136, 503616, 1610496, 5086336, 15895552, 49229312, 151275008, 461662208, 1400356864, 4224703488, 12683452416, 37911164928, 112865394688, 334788444160, 989756825600
Offset: 0
Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002
The first 6 nu polynomials are nu(0)=1, nu(1)=2, nu(2)=6, nu(3)=16+4q, nu(4)=44+20q+12q^2, nu(5)=120+80q+64q^2+40q^3+8q^4, so the coefficients of q^2 are 0,0,0,0,12,64.
- M. Beattie, S. Dăscălescu and S. Raianu, Lifting of Nichols Algebras of Type B_2, arXiv:math/0204075 [math.QA], 2002.
- Index entries for linear recurrences with constant coefficients, signature (6, -6, -16, 12, 24, 8).
-
nu := proc(n,b,lambda) if n = 0 then 1 ; elif n = 1 then b ; else b*nu(n-1,b,lambda)+lambda*nu(n-2,b,lambda)*add(q^i,i=0..n-2) ; fi ; end: A074359 := proc(n) local b,lambda,thisnu ; b := 2 ; lambda := 2 ; thisnu := nu(n,b,lambda) ; RETURN( coeftayl(thisnu,q=0,2) ) ; end: for n from 0 to 40 do printf("%d, ",A074359(n) ) ; od ; # R. J. Mathar, Mar 20 2007
-
Join[{0, 0}, LinearRecurrence[{6, -6, -16, 12, 24, 8}, {0, 0, 12, 64, 280, 1088}, 24]] (* Jean-François Alcover, Sep 23 2017 *)
Showing 1-5 of 5 results.
Comments