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.

Showing 1-2 of 2 results.

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

Views

Author

Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002

Keywords

Comments

Coefficient of q^0 is A002605.

Examples

			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.
		

Crossrefs

Coefficient of q^0, q^2 and q^3 are in A002605, A074359 and A074360. Related sequences with other values of b and lambda are in A074082-A074089, A074352-A074357, A074361-A074363.

Programs

  • Maple
    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
  • Mathematica
    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 *)

Formula

G.f.: 4*x^3*(x + 1)/(2*x^2 + 2*x - 1)^2 (conjectured). - Chai Wah Wu, May 30 2016
a(n) = (1/18)*((1 + sqrt(3))^n*(-9 + 2*sqrt(3)) - (1 - sqrt(3))^n*(9 + 2*sqrt(3)) + 3*((1 - sqrt(3))^n + (1 + sqrt(3))^n)*n) for n > 0 (conjectured). - Colin Barker, Nov 17 2017
a(n) = 4*a(n-1) - 8*a(n-3) - 4*a(n-4) for n > 4 (conjectured). - Colin Barker, Nov 17 2017

Extensions

More terms from R. J. Mathar, Sep 20 2006

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

Views

Author

Y. Kelly Itakura (yitkr(AT)mta.ca), Aug 21 2002

Keywords

Comments

Coefficient of q^0 is A002605.

Examples

			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.
		

Crossrefs

Coefficient of q^0, q^1 and q^2 are in A002605, A074358 and A074359. Related sequences with other values of b and lambda are in A074082-A074089, A074352-A074357, A074361-A074363.

Programs

  • Maple
    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
  • Mathematica
    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 *)

Formula

Conjecture: O.g.f: 8*x^5*(1+x)*(12*x^4+24*x^3-2*x^2-16*x+5)/(2*x^2+2*x-1)^4. - R. J. Mathar, Jul 22 2009

Extensions

More terms from R. J. Mathar, Sep 20 2006
Showing 1-2 of 2 results.