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!)
A210596 Triangle read by rows of coefficients of polynomials v(n,x) jointly generated with A210221; see the Formula section. 3

%I #36 Apr 13 2020 10:15:32

%S 1,1,2,2,2,4,3,6,4,8,5,10,16,8,16,8,20,28,40,16,32,13,36,64,72,96,32,

%T 64,21,66,124,184,176,224,64,128,34,118,248,376,496,416,512,128,256,

%U 55,210,476,808,1056,1280,960,1152,256,512,89,370,908,1640,2416

%N Triangle read by rows of coefficients of polynomials v(n,x) jointly generated with A210221; see the Formula section.

%C Row n begins with F(n) and ends with 2^(n-1), where F = A000045 (Fibonacci numbers)

%C Row sums: odd-indexed Fibonacci numbers, see A001519.

%C For a discussion and guide to related arrays, see A208510.

%C Riordan array (1/(1 - z - z^2), 2*z*(1 - z)/(1 - z - z^2)). - _Peter Bala_, Dec 30 2015

%H G. C. Greubel, <a href="/A210596/b210596.txt">Rows n=1..102 of triangle, flattened</a>

%F u(n,x) = u(n-1,x) + v(n-1,x),

%F v(n,x) = u(n-1,x) + 2x*v(n-1,x),

%F where u(1,x) = 1, v(1,x) = 1.

%F T(n,k) = T(n-1,k) + 2*T(n-1,k-1) + T(n-2,k) - 2*T(n-2,k-1), T(1,0) = T(2,0) = 1, T(2,1) = 2, T(n,k) = 0 if k<0 or if k>=n. - _Philippe Deléham_, Mar 25 2012

%F G.f.: 1/((1-x-x^2) - t*2*x*(1-x)). - _G. C. Greubel_, Dec 15 2018

%e First five rows:

%e 1

%e 1 2

%e 2 2 4

%e 3 6 4 8

%e 5 10 16 8 16

%e First three polynomials v(n,x): 1, 1 + 2x, 2 + 2x + 4x^2.

%t u[1, x_] := 1; v[1, x_] := 1; z = 16;

%t u[n_, x_] := u[n - 1, x] + v[n - 1, x];

%t v[n_, x_] := u[n - 1, x] + 2 x*v[n - 1, x];

%t Table[Expand[u[n, x]], {n, 1, z/2}]

%t Table[Expand[v[n, x]], {n, 1, z/2}]

%t cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];

%t TableForm[cu]

%t Flatten[%] (* A210221 *)

%t Table[Expand[v[n, x]], {n, 1, z}]

%t cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];

%t TableForm[cv]

%t Flatten[%] (* A210596 *)

%t With[{m = 10}, CoefficientList[CoefficientList[Series[1/((1-x-x^2) - t*2*x*(1-x)), {x, 0, m}, {t, 0, m}], x], t]]//Flatten (* _G. C. Greubel_, Dec 15 2018 *)

%o (Python)

%o from sympy import Poly

%o from sympy.abc import x

%o def u(n, x): return 1 if n==1 else u(n - 1, x) + v(n - 1, x)

%o def v(n, x): return 1 if n==1 else u(n - 1, x) + 2*x*v(n - 1, x)

%o def a(n): return Poly(v(n, x), x).all_coeffs()[::-1]

%o for n in range(1, 13): print (a(n)) # _Indranil Ghosh_, May 27, 2017

%o (PARI) {T(n,k) = if(n==1 && k==0, 1, if(n==2 && k==0, 1, if(n==2 && k==1, 2, if(k<0 || k>n-1, 0, T(n-1,k) + 2*T(n-1,k-1) + T(n-2,k) - 2*T(n-2,k-1) ))))};

%o for(n=1,15, for(k=0, n-1, print1(T(n,k), ", "))) \\ _G. C. Greubel_, Dec 15 2018

%Y Cf. A000045, A000079, A001519, A210221, A208510.

%K nonn,tabl

%O 1,3

%A _Clark Kimberling_, Mar 24 2012

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 April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)