A084059 -id:A084059 - cp's OEIS frontend

A090017 a(n) = 4a(n-1) + 2a(n-2) for n>1, a(0)=0, a(1)=1.

0, 1, 4, 18, 80, 356, 1584, 7048, 31360, 139536, 620864, 2762528, 12291840, 54692416, 243353344, 1082798208, 4817899520, 21437194496, 95384577024, 424412697088, 1888419942400, 8402505163776, 37386860539904, 166352452487168

Offset: 0

Paul Barry, Nov 19 2003

Starting with "1" = INVERT transform of A007482: (1, 3, 11, 39, 139, ...). - Gary W. Adamson, Aug 06 2010
This is the Lucas sequence U(4,-2). - Bruno Berselli, Jan 09 2013
Lower left term in matrix powers of [(1,5); (1,3)]. Convolved with (1, 2, 0, 0, 0, ...) the result is A164549: (1, 6, 26, 116, ...). - Gary W. Adamson, Aug 10 2016
For n>0, a(n) equals the number of words of length n-1 over {0,1,2,3,4,5} in which 0 and 1 avoid runs of odd lengths. - Milan Janjic, Jan 08 2017

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Wikipedia, Lucas sequence: Specific names.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (4,2).

Cf. A007070, A084059, A007482.

Cf. A164549.

I:=[0,1]; [n le 2 select I[n] else 4*Self(n-1)+2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Oct 12 2011

a[n_Integer] := (-I Sqrt[2])^(n - 1) ChebyshevU[ n - 1, I Sqrt[2] ]
a[n_]:=(MatrixPower[{{1,5},{1,3}},n].{{1},{1}})[[2,1]]; Table[Abs[a[n]],{n,-1,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 19 2010 *)
t={0,1};Do[AppendTo[t,4*t[[-1]]+2*t[[-2]]],{n,2,23}];t (* or *) LinearRecurrence[{4,2},{0,1},24] (* Indranil Ghosh, Feb 21 2017 *)

Vec(x/(1-4*x-2*x^2)+O(x^99)) \\ Charles R Greathouse IV, Oct 12 2011

[lucas_number1(n, 4, -2) for n in range(0, 23)] # Zerinvary Lajos, Apr 23 2009

G.f.: x/(1 - 4*x - 2*x^2).
a(n) = (-i*sqrt(2))^(n-1) U(n-1, i*sqrt(2)) where U is the Chebyshev polynomial of the second kind and i^2 = -1.
a(n) = ((2+sqrt(6))^n - (2-sqrt(6))^n)/(2 sqrt(6)). - Al Hakanson (hawkuu(AT)gmail.com), Jan 05 2009, Jan 07 2009
a(n+1) = Sum_{k=0..n} A099089(n,k)*2^k. - Philippe Deléham, Nov 21 2011
From Ilya Gutkovskiy, Aug 22 2016: (Start)
E.g.f.: sinh(sqrt(6)*x)*exp(2*x)/sqrt(6).
Number of zeros in substitution system {0 -> 11, 1 -> 11011} at step n from initial string "1" (1 -> 11011 -> 1101111011111101111011 -> ...). (End)

Edited by Stuart Clary, Oct 25 2009

A201730 Triangle T(n,k), read by rows, given by (2,1/2,3/2,0,0,0,0,0,0,0,...) DELTA (0,1/2,-1/2,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

Original entry on oeis.org

1, 2, 0, 5, 1, 0, 14, 6, 0, 0, 41, 26, 1, 0, 0, 122, 100, 10, 0, 0, 0, 365, 363, 63, 1, 0, 0, 0, 1094, 1274, 322, 14, 0, 0, 0, 0, 3281, 4372, 1462, 116, 1, 0, 0, 0, 0, 9842, 14760, 6156, 744, 18, 0, 0, 0, 0, 0

Offset: 0

Philippe Deléham, Dec 04 2011

Riordan array ((1-2x)/(1-4x+3x^2),x^2/(1-4x+3x^2)).

A007318*A201701 as lower triangular matrices.

			Triangle begins:
1
2, 0
5, 1, 0
14, 6, 0, 0
41, 26, 1, 0, 0
122, 100, 10, 0, 0, 0
365, 363, 63, 1, 0, 0, 0

Cf. A007051 (1st column), A261064 (2nd column).

A201730 := proc(n,k)
    (1-2*x)/(1-4*x+(3-y)*x^2) ;
    coeftayl(%,y=0,k) ;
    coeftayl(%,x=0,n) ;
end proc:
seq(seq(A201730(n,k),k=0..n),n=0..12) ; # R. J. Mathar, Dec 06 2011

m = 13;
(* DELTA is defined in A084938 *)
DELTA[Join[{2, 1/2, 3/2}, Table[0, {m}]], Join[{0, 1/2, -1/2}, Table[0, {m}]], m] // Flatten (* Jean-François Alcover, Feb 19 2020 *)

G.f.: (1-2x)/(1-4x+(3-y)*x^2).
Sum_{k, 0<=k<=n} T(n,k)*x^k = A139011(n), A000079(n), A007051(n), A006012(n), A001075(n), A081294(n), A001077(n), A084059(n), A108851(n), A084128(n), A081340(n), A084132(n) for x = -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 respectively.
Sum_{k, k>+0} T(n+k,k) = A081704(n) .
T(n,k) = 3*T(n-1,k)+ Sum_{j>0} T(n-1-j,k-1).
T(n,k) = 4*T(n-1,k)+ T(n-2,k-1) - 3*T(n-2,k) with T(0,0)=1, T(1,0)= 2, T(1,1) = 0 and T(n,k) = 0 if k<0 or if n

A084120 a(n) = 6a(n-1) - 3a(n-2), a(0)=1, a(1)=3.

Original entry on oeis.org

1, 3, 15, 81, 441, 2403, 13095, 71361, 388881, 2119203, 11548575, 62933841, 342957321, 1868942403, 10184782455, 55501867521, 302456857761, 1648235544003, 8982042690735, 48947549512401, 266739169002201

Offset: 0

Paul Barry, May 13 2003

Binomial transform of A084059.

			G.f. = 1 + 3*x + 15*x^2 + 81*x^3 + 441*x^4 + 2403*x^5 + 13095*x^6 + ...

Harvey P. Dale, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-3).

Cf. A084059, A138395, A147720.

[n le 2 select 3^(n-1) else 6*Self(n-1) -3*Self(n-2): n in [1..41]]; // G. C. Greubel, Oct 13 2022

LinearRecurrence[{6,-3},{1,3},30] (* Harvey P. Dale, Feb 25 2014 *)

{a(n) = if( n<0, 0, polsym(x^2 - 6*x + 3, n)[1+n] / 2)};

[lucas_number2(n,6,3)/2 for n in range(0,27)] # Zerinvary Lajos, Jul 08 2008

a(n) = ((3+sqrt(6))^n + (3-sqrt(6))^n)/2.
G.f.: (1-3*x)/(1-6*x+3*x^2).
E.g.f.: exp(3*x)*cosh(sqrt(6)*x).
a(n) = 3^n * Sum_{k=0..floor(n/2)} C(n, 2*k)*(2/3)^k. - Paul Barry, Sep 10 2005
Lim_{n -> oo} a(n)/a(n-1) = (3 + sqrt(6)) = 5.445489742... - Gary W. Adamson, Mar 19 2008
a(n) = Sum_{k=0..n} A147720(n,k)*3^k. - Philippe Deléham, Nov 15 2008
G.f.: G(0)/2, where G(k)= 1 + 1/(1 - x*(2*k-3)/(x*(2*k-1) - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 27 2013
a(n) = A138395(n) - 3*A138395(n-1). - R. J. Mathar, May 11 2022

A124182 A skewed version of triangular array A081277.

Original entry on oeis.org

1, 0, 1, 0, 1, 2, 0, 0, 3, 4, 0, 0, 1, 8, 8, 0, 0, 0, 5, 20, 16, 0, 0, 0, 1, 18, 48, 32, 0, 0, 0, 0, 7, 56, 112, 64, 0, 0, 0, 0, 1, 32, 160, 256, 128, 0, 0, 0, 0, 0, 9, 120, 432, 576, 256, 0, 0, 0, 0, 0, 1, 50, 400, 1120, 1280, 512

Offset: 0

Philippe Deléham, Dec 05 2006

Triangle T(n,k), 0 <= k <= n, read by rows given by [0, 1, -1, 0, 0, 0, 0, 0, 0, ...] DELTA [1, 1, 0, 0, 0, 0, 0, 0, 0,...] where DELTA is the operator defined in A084938. Falling diagonal sums in A052980.

			Triangle begins:
  1;
  0, 1;
  0, 1, 2;
  0, 0, 3, 4;
  0, 0, 1, 8,  8;
  0, 0, 0, 5, 20, 16;
  0, 0, 0, 1, 18, 48,  32;
  0, 0, 0, 0,  7, 56, 112,  64;
  0, 0, 0, 0,  1, 32, 160, 256,  128;
  0, 0, 0, 0,  0,  9, 120, 432,  576,  256;
  0, 0, 0, 0,  0,  1,  50, 400, 1120, 1280, 512;

Cf. A025192 (column sums). Diagonals include A011782, A001792, A001793, A001794, A006974, A006975, A006976.

T(0,0)=T(1,1)=1, T(n,k)=0 if n < k or if k < 0, T(n,k) = T(n-2,k-1) + 2*T(n-1,k-1).
Sum_{k=0..n} x^k*T(n,k) = (-1)^n*A090965(n), (-1)^n*A084120(n), (-1)^n*A006012(n), A033999(n), A000007(n), A001333(n), A084059(n) for x = -4, -3, -2, -1, 0, 1, 2 respectively.
Sum_{k=0..floor(n/2)} T(n-k,k) = Fibonacci(n-1) = A000045(n-1).
Sum_{k=0..n} T(n,k)*x^(n-k) = A000012(n), A011782(n), A001333(n), A026150(n), A046717(n), A084057(n), A002533(n), A083098(n), A084058(n), A003665(n), A002535(n), A133294(n), A090042(n), A125816(n), A133343(n), A133345(n), A120612(n), A133356(n), A125818(n) for x = -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17 respectively. - Philippe Deléham, Dec 26 2007
Sum_{k=0..n} T(n,k)*(-x)^(n-k) = A011782(n), A000012(n), A146559(n), A087455(n), A138230(n), A006495(n), A138229(n) for x= 0,1,2,3,4,5,6 respectively. - Philippe Deléham, Nov 14 2008
G.f.: (1-y*x)/(1-2y*x-y*x^2). - Philippe Deléham, Dec 04 2011
Sum_{k=0..n} T(n,k)^2 = A002002(n) for n > 0. - Philippe Deléham, Dec 04 2011

A162516 Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x+d)^n + (x-d)^n)/2, where d=sqrt(x+4).

Original entry on oeis.org

1, 1, 0, 1, 1, 4, 1, 3, 12, 0, 1, 6, 25, 8, 16, 1, 10, 45, 40, 80, 0, 1, 15, 75, 121, 252, 48, 64, 1, 21, 119, 287, 644, 336, 448, 0, 1, 28, 182, 588, 1457, 1360, 1888, 256, 256, 1, 36, 270, 1092, 3033, 4176, 6240, 2304, 2304, 0, 1, 45, 390, 1890, 5925, 10801, 17780, 11680, 12160, 1280, 1024

Offset: 0

Clark Kimberling, Jul 05 2009

			First six rows:
  1;
  1,  0;
  1,  1,  4;
  1,  3, 12,  0;
  1,  6, 25,  8, 16;
  1, 10, 48, 40, 80, 0;

G. C. Greubel, Rows n = 0..100 of triangle, flattened

Cf. A162514, A162515, A162517.
Cf. A000217, A026150, A084057, A125818, A199572.
For fixed k, the sequences P(n,k), for n=1,2,3,4,5, are A084057, A084059, A146963, A081342, A081343, respectively.

m:=12;
p:= func< n,x | ((x+Sqrt(x+4))^n + (x-Sqrt(x+4))^n)/2 >;
R:=PowerSeriesRing(Rationals(), m+1);
T:= func< n,k | Coefficient(R!( p(n,x) ), n-k) >;
[T(n,k): k in [0..n], n in [0..m]]; // G. C. Greubel, Jul 09 2023

P[n_, x_]:= P[n, x]= ((x+Sqrt[x+4])^n + (x-Sqrt[x+4])^n)/2;
T[n_, k_]:= Coefficient[Series[P[n, x], {x,0,n-k+1}], x, n-k];
Table[T[n, k], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, Jan 08 2020; Jul 09 2023 *)

def p(n,x): return ((x+sqrt(x+4))^n + (x-sqrt(x+4))^n)/2
def T(n,k):
    P. = PowerSeriesRing(QQ)
    return P( p(n,x) ).list()[n-k]
flatten([[T(n,k) for k in range(n+1)] for n in range(13)]) # G. C. Greubel, Jul 09 2023

P(n,x) = 2*x*P(n-1,x) - (x^2 -x -4)*P(n-2,x).
From G. C. Greubel, Jul 09 2023: (Start)
T(n, k) = [x^(n-k)] ( ((x+sqrt(x+4))^n + (x-sqrt(x+4))^n)/2 ).
T(n, 1) = A000217(n-1), n >= 1.
T(n, n) = A199572(n).
Sum_{k=0..n} T(n, k) = A084057(n).
Sum_{k=0..n} 2^k*T(n, k) = A125818(n).
Sum_{k=0..n} (-1)^k*T(n, k) = A026150(n).
Sum_{k=0..n} (-2)^k*T(n, k) = A133343(n). (End)

A191347 Array read by antidiagonals: ((floor(sqrt(n)) + sqrt(n))^k + (floor(sqrt(n)) - sqrt(n))^k)/2 for columns k >= 0 and rows n >= 0.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 4, 3, 1, 1, 0, 8, 7, 4, 2, 1, 0, 16, 17, 10, 8, 2, 1, 0, 32, 41, 28, 32, 9, 2, 1, 0, 64, 99, 76, 128, 38, 10, 2, 1, 0, 128, 239, 208, 512, 161, 44, 11, 2, 1, 0, 256, 577, 568, 2048, 682, 196, 50, 12, 3, 1

Offset: 0

Charles L. Hohn, May 31 2011

			1, 0,  0,   0,    0,    0,     0,      0,       0,        0,        0, ...
1, 1,  2,   4,    8,   16,    32,     64,     128,      256,      512, ...
1, 1,  3,   7,   17,   41,    99,    239,     577,     1393,     3363, ...
1, 1,  4,  10,   28,   76,   208,    568,    1552,     4240,    11584, ...
1, 2,  8,  32,  128,  512,  2048,   8192,   32768,   131072,   524288, ...
1, 2,  9,  38,  161,  682,  2889,  12238,   51841,   219602,   930249, ...
1, 2, 10,  44,  196,  872,  3880,  17264,   76816,   341792,  1520800, ...
1, 2, 11,  50,  233, 1082,  5027,  23354,  108497,   504050,  2341691, ...
1, 2, 12,  56,  272, 1312,  6336,  30592,  147712,   713216,  3443712, ...
1, 3, 18, 108,  648, 3888, 23328, 139968,  839808,  5038848, 30233088, ...
1, 3, 19, 117,  721, 4443, 27379, 168717, 1039681,  6406803, 39480499, ...
1, 3, 20, 126,  796, 5028, 31760, 200616, 1267216,  8004528, 50561600, ...
1, 3, 21, 135,  873, 5643, 36477, 235791, 1524177,  9852435, 63687141, ...
1, 3, 22, 144,  952, 6288, 41536, 274368, 1812352, 11971584, 79078912, ...
1, 3, 23, 153, 1033, 6963, 46943, 316473, 2133553, 14383683, 96969863, ...
...

Row 1 is A000007, row 2 is A011782, row 3 is A001333, row 4 is A026150, row 5 is A081294, row 6 is A001077, row 7 is A084059, row 8 is A108851, row 9 is A084128, row 10 is A081341, row 11 is A005667, row 13 is A141041.
Row 3*2 is A002203, row 4*2 is A080040, row 5*2 is A155543, row 6*2 is A014448, row 8*2 is A080042, row 9*2 is A170931, row 11*2 is A085447.
Cf. A191348 which uses ceiling() in place of floor().

T(n, k) = if (n==0, k==0, my(x=sqrtint(n)); sum(i=0, (k+1)\2, binomial(k, 2*i)*x^(k-2*i)*n^i));
matrix(9,9, n, k, T(n-1,k-1)) \\ Michel Marcus, Aug 22 2019

T(n, k) = if (k==0, 1, if (k==1, sqrtint(n), T(n,k-2)*(n-T(n,1)^2) + T(n,k-1)*T(n,1)*2));
matrix(9, 9, n, k, T(n-1, k-1)) \\ Charles L. Hohn, Aug 22 2019

For each row n>=0 let T(n,0)=1 and T(n,1)=floor(sqrt(n)), then for each column k>=2: T(n,k)=T(n,k-2)*(n-T(n,1)^2) + T(n,k-1)*T(n,1)*2. - Charles L. Hohn, Aug 22 2019

T(n, k) = Sum_{i=0..floor((k+1)/2)} binomial(k, 2*i)*floor(sqrt(n))^(k-2*i)*n^i for n > 0, with T(0, 0) = 1 and T(0, k) = 0 for k > 0. - Michel Marcus, Aug 23 2019

A268409 a(n) = 4a(n - 1) + 2a(n - 2) for n>1, a(0)=3, a(1)=5.

Original entry on oeis.org

3, 5, 26, 114, 508, 2260, 10056, 44744, 199088, 885840, 3941536, 17537824, 78034368, 347213120, 1544921216, 6874111104, 30586286848, 136093369600, 605546052096, 2694370947584, 11988575894528, 53343045473280, 237349333682176, 1056083425675264

Offset: 0

Ilya Gutkovskiy, Feb 04 2016

In general, the ordinary generating function for the recurrence relation b(n) = r*b(n - 1) + s*b(n - 2), with n>1 and b(0)=k, b(1)=m, is (k - (k*r - m)*x)/(1 - r*x - s*x^2). This recurrence gives the closed form b(n) = (2^(-n - 1)*((k*r - 2*m)*(r - sqrt(r^2 + 4*s))^n + (2*m - k*r)*(sqrt(r^2 + 4*s) + r)^n + k*sqrt(r^2 + 4*s)*(r - sqrt(r^2 + 4*s))^n + k*sqrt(r^2 + 4*s)*(sqrt(r^2 + 4*s) + r)^n))/sqrt(r^2 + 4*s).

Index entries for linear recurrences with constant coefficients, signature (4,2).

Cf. A021001, A084059, A090017, A107979, A164549, A176213, A189741.

[n le 2 select 2*n+1 else 4*Self(n-1)+2*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Feb 04 2016

RecurrenceTable[{a[0] == 3, a[1] == 5, a[n] == 4 a[n - 1] + 2 a[n - 2]}, a, {n, 23}]
LinearRecurrence[{4, 2}, {3, 5}, 24]
Table[((18 + Sqrt[6]) (2 - Sqrt[6])^n - (Sqrt[6] - 18) (2 + Sqrt[6])^n)/12, {n, 0, 23}]

Vec((3 - 7*x)/(1 - 4*x - 2*x^2) + O(x^30)) \\ Michel Marcus, Feb 04 2016

G.f.: (3 - 7*x)/(1 - 4*x - 2*x^2).
a(n) = ((18 + sqrt(6))*(2 - sqrt(6))^n - (sqrt(6) - 18)*(2 + sqrt(6))^n)/12.
Lim_{n -> infinity} a(n + 1)/a(n) = 2 + sqrt(6) = A176213.
a(n) = 3*A090017(n+1) -7*A090017(n). - R. J. Mathar, Mar 12 2017

Showing 1-7 of 7 results.

cp's OEIS Frontend

A090017 a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=0, a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A201730 Triangle T(n,k), read by rows, given by (2,1/2,3/2,0,0,0,0,0,0,0,...) DELTA (0,1/2,-1/2,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A084120 a(n) = 6*a(n-1) - 3*a(n-2), a(0)=1, a(1)=3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A124182 A skewed version of triangular array A081277.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A162516 Triangle of coefficients of polynomials defined by Binet form: P(n,x) = ((x+d)^n + (x-d)^n)/2, where d=sqrt(x+4).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A191347 Array read by antidiagonals: ((floor(sqrt(n)) + sqrt(n))^k + (floor(sqrt(n)) - sqrt(n))^k)/2 for columns k >= 0 and rows n >= 0.

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

PARI

Formula

A268409 a(n) = 4*a(n - 1) + 2*a(n - 2) for n>1, a(0)=3, a(1)=5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

A090017 a(n) = 4a(n-1) + 2a(n-2) for n>1, a(0)=0, a(1)=1.

A084120 a(n) = 6a(n-1) - 3a(n-2), a(0)=1, a(1)=3.

A268409 a(n) = 4a(n - 1) + 2a(n - 2) for n>1, a(0)=3, a(1)=5.