A164298 -id:A164298 - cp's OEIS frontend

A081185 8th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).

0, 1, 16, 194, 2112, 21764, 217280, 2127112, 20562432, 197117968, 1879016704, 17842953248, 168988216320, 1597548359744, 15083504344064, 142288071200896, 1341431869882368, 12641049503662336, 119088016125890560

Offset: 0

Paul Barry, Mar 11 2003

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 - 2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (16,-62).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), A164300 (m=3), A164301 (m=4), A164598 (m=5), A164599 (m=6), this sequence (m=7), A164600 (m=8).
Binomial transform of A081184.
Cf. A081185, A147959.

[n le 2 select n-1 else 16*Self(n-1)-62*Self(n-2): n in [1..25]]; // Vincenzo Librandi, Aug 07 2013

m:=30; S:=series( x/(1-16*x+62*x^2), x, m+1):
seq(coeff(S, x, j), j=0..m); # G. C. Greubel, Mar 12 2021

Join[{a=0,b=1},Table[c=16*b-62*a;a=b;b=c,{n,40}]] (* Vladimir Joseph Stephan Orlovsky, Feb 08 2011 *)
CoefficientList[Series[x/(1-16x+62x^2), {x, 0, 20}], x] (* Vincenzo Librandi, Aug 07 2013 *)
LinearRecurrence[{16,-62},{0,1},30] (* Harvey P. Dale, Sep 24 2013 *)

[( x/(1-16*x+62*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 12 2021

a(n) = 16*a(n-1) - 62*a(n-2), a(0)=0, a(1)=1.
G.f.: x/(1 - 16*x + 62*x^2).
a(n) = ((8 + sqrt(2))^n - (8 - sqrt(2))^n)/(2*sqrt(2)).
a(n) = Sum_{k=0..n} C(n,2*k+1) * 2^k * 7^(n-2*k-1).
E.g.f.: exp(8*x)*sinh(sqrt(2)*x)/sqrt(2). - Ilya Gutkovskiy, Aug 12 2017
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = 2*A147959(n) + 8*A081185(n).
a(n) = (1/2)*Sum_{k=0..n-1} binomial(n-1,k)*7^(n-k-1)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

A164587 a(n) = 2*a(n - 2) for n > 2; a(1) = 1, a(2) = 8.

Original entry on oeis.org

1, 8, 2, 16, 4, 32, 8, 64, 16, 128, 32, 256, 64, 512, 128, 1024, 256, 2048, 512, 4096, 1024, 8192, 2048, 16384, 4096, 32768, 8192, 65536, 16384, 131072, 32768, 262144, 65536, 524288, 131072, 1048576, 262144, 2097152, 524288, 4194304, 1048576

Offset: 1

Klaus Brockhaus, Aug 17 2009

nonn

Interleaving of A000079 and A000079 without initial terms 1, 2, 4.

Binomial transform is A048696. Second binomial transform is A164298.

G. C. Greubel, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (0, 2).

Equals A112032 without initial term 4.

Cf. A000079 (powers of 2), A048696, A164298.

[ n le 2 select 7*n-6 else 2*Self(n-2): n in [1..41] ];

CoefficientList[Series[(1 - x)/(1 - 10*x + 17*x^2), {x,0,50}], x] (* G. C. Greubel, Aug 12 2017 *)

x='x+O('x^50); Vec(x*(1+8*x)/(1-2*x^2)) \\ G. C. Greubel, Aug 12 2017

a(n) = (5 + 3*(-1)^n)*2^((2*n -5 +(-1)^n)/4).
G.f.: x*(1+8*x)/(1-2*x^2).
E.g.f.: 4*cosh(sqrt(2)*x) + (1/sqrt(2))*sinh(sqrt(2)*x) - 4. - G. C. Greubel, Aug 12 2017

A164600 a(n) = 18a(n-1) - 79a(n-2) for n > 1; a(0) = 1, a(1) = 17.

Original entry on oeis.org

1, 17, 227, 2743, 31441, 349241, 3802499, 40854943, 434991553, 4602307457, 48477201539, 509007338599, 5332433173201, 55772217368297, 582637691946467, 6081473282940943, 63438141429166081, 661450156372654961

Offset: 0

Klaus Brockhaus, Aug 17 2009

nonn

Binomial transform of A081185 without initial term 0. Ninth binomial transform of A164587.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 - 2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

G. C. Greubel, Table of n, a(n) for n = 0..975 (terms 0..100 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (18, -79).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), A164300 (m=3), A164301 (m=4), A164598 (m=5), A164599 (m=6), A081185 (m=7), this sequence (m=8).

Cf. A147960, A153593, A164587.

[ n le 2 select 16*n-15 else 18*Self(n-1)-79*Self(n-2): n in [1..18] ];

m:=30; S:=series( (1-x)/(1-18*x+79*x^2), x, m+1):
seq(coeff(S, x, j), j=0..m); # G. C. Greubel, Mar 12 2021

LinearRecurrence[{18,-79},{1,17},30] (* Harvey P. Dale, Oct 30 2013 *)

my(x='x+O('x^50)); Vec((1-x)/(1-18*x+79*x^2)) \\ G. C. Greubel, Aug 11 2017

[( (1-x)/(1-18*x+79*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 12 2021

a(n) = ((1+4*sqrt(2))*(9+sqrt(2))^n + (1-4*sqrt(2))*(9-sqrt(2))^n)/2.
G.f.: (1-x)/(1-18*x+79*x^2).
E.g.f.: exp(9*x)*(cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x)). - G. C. Greubel, Aug 11 2017
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = 2*A147960(n) + 8*A153593(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*8^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

A164299 a(n) = ((1+4sqrt(2))(3+sqrt(2))^n + (1-4sqrt(2))(3-sqrt(2))^n)/2.

Original entry on oeis.org

1, 11, 59, 277, 1249, 5555, 24587, 108637, 479713, 2117819, 9348923, 41268805, 182170369, 804140579, 3549650891, 15668921293, 69165971521, 305313380075, 1347718479803, 5949117218293, 26260673951137, 115920223178771

Offset: 0

Al Hakanson (hawkuu(AT)gmail.com), Aug 12 2009

nonn

Binomial transform of A164298. Third binomial transform of A164587. Inverse binomial transform of A164300.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 - 2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-7).

Sequences in the class a(n, m): A164298 (m=1), this sequence (m=2), A164300 (m=3), A164301 (m=4), A164598 (m=5), A164599 (m=6), A081185 (m=7), A164600 (m=8).

Cf. A081179, A083878, A164587.

Z:=PolynomialRing(Integers()); N:=NumberField(x^2-2); S:=[ ((1+4*r)*(3+r)^n+(1-4*r)*(3-r)^n)/2: n in [0..21] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Aug 17 2009

LinearRecurrence[{6,-7}, {1,11}, 50] (* or *) CoefficientList[Series[(1 + 5*x)/(1 - 6*x + 7*x^2), {x,0,50}], x] (* G. C. Greubel, Sep 12 2017 *)

my(x='x+O('x^50)); Vec((1+5*x)/(1-6*x+7*x^2)) \\ G. C. Greubel, Sep 12 2017

[( (1+5*x)/(1-6*x+7*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 12 2021

a(n) = 6*a(n-1) - 7*a(n-2) for n > 1; a(0) = 1, a(1) = 11.
G.f.: (1+5*x)/(1-6*x+7*x^2).
E.g.f.: (cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x))*exp(3*x). - G. C. Greubel, Sep 12 2017
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = 2*A083878(n) + 8*A081179(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*2^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

Edited and extended beyond a(5) by Klaus Brockhaus, Aug 17 2009

A164300 a(n) = ((1+4sqrt(2))(4+sqrt(2))^n + (1-4sqrt(2))(4-sqrt(2))^n)/2.

Original entry on oeis.org

1, 12, 82, 488, 2756, 15216, 83144, 452128, 2453008, 13294272, 72012064, 389976704, 2111644736, 11433484032, 61904845952, 335169991168, 1814692086016, 9825156811776, 53195565289984, 288012326955008

Offset: 0

Al Hakanson (hawkuu(AT)gmail.com), Aug 12 2009

Binomial transform of A164299. Fourth binomial transform of A164587. Inverse binomial transform of A164301.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 -2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (8,-14).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), this sequence (m=3), A164301 (m=4), A164598 (m=5), A164599 (m=6), A081185 (m=7), A164600 (m=8).

Cf. A081180, A083879, A164587.

Z:=PolynomialRing(Integers()); N:=NumberField(x^2-2); S:=[ ((1+4*r)*(4+r)^n+(1-4*r)*(4-r)^n)/2: n in [0..19] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Aug 17 2009

LinearRecurrence[{8,-14},{1,12},30] (* Harvey P. Dale, Apr 13 2012 *)

my(x='x+O('x^50)); Vec((1+4*x)/(1-8*x+14*x^2)) \\ G. C. Greubel, Sep 13 2017

[( (1+4*x)/(1-8*x+14*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 12 2021

a(n) = 8*a(n-1) - 14*a(n-2) for n > 1; a(0) = 1, a(1) = 12.
G.f.: (1+4*x)/(1-8*x+14*x^2).
E.g.f.: (4*sqrt(2)*sinh(sqrt(2)*x) + cosh(sqrt(2)*x))*exp(4*x). - Ilya Gutkovskiy, Jun 24 2016
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = 2*A083879(n) + 8*A081180(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*3^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

Edited and extended beyond a(5) by Klaus Brockhaus, Aug 17 2009

A164301 a(n) = ((1+4sqrt(2))(5+sqrt(2))^n + (1-4sqrt(2))(5-sqrt(2))^n)/2.

Original entry on oeis.org

1, 13, 107, 771, 5249, 34757, 226843, 1469019, 9472801, 60940573, 391531307, 2513679891, 16131578849, 103501150997, 663985196443, 4259325491499, 27321595396801, 175251467663533, 1124117982508907, 7210396068827811, 46249247090573249, 296653361322692837

Offset: 0

Al Hakanson (hawkuu(AT)gmail.com), Aug 12 2009

nonn

Binomial transform of A164300. Fifth binomial transform of A164587. Inverse binomial transform of A164598.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 - 2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 - 2)*x^2) and has a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 12 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000 (terms 0..100 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (10,-23).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), A164300 (m=3), this sequence (m=4), A164598 (m=5), A164599 (m=6), A081185 (m=7), A164600 (m=8).

Cf. A081182, A083880, A164587.

Z:=PolynomialRing(Integers()); N:=NumberField(x^2-2); S:=[ ((1+4*r)*(5+r)^n+(1-4*r)*(5-r)^n)/2: n in [0..19] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Aug 17 2009

LinearRecurrence[{10,-23},{1,13},20] (* Harvey P. Dale, Oct 15 2015 *)

my(x='x+O('x^50)); Vec((1+3*x)/(1-10*x+23*x^2)) \\ G. C. Greubel, Sep 13 2017

[( (1+3*x)/(1-10*x+23*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 12 2021

a(n) = 10*a(n-1) - 23*a(n-2) for n > 1; a(0) = 1, a(1) = 13.
G.f.: (1+3*x)/(1-10*x+23*x^2).
E.g.f.: ( cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x) )*exp(5*x). - G. C. Greubel, Sep 13 2017
From G. C. Greubel, Mar 12 2021: (Start)
a(n) = 2*A083880(n) + 8*A081182(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*4^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

Edited and extended beyond a(5) by Klaus Brockhaus, Aug 17 2009

A164598 a(n) = 12a(n-1) - 34a(n-2), for n > 1, with a(0) = 1, a(1) = 14.

Original entry on oeis.org

1, 14, 134, 1132, 9028, 69848, 531224, 3999856, 29936656, 223244768, 1661090912, 12342768832, 91636134976, 679979479424, 5044125163904, 37410199666432, 277422140424448, 2057118896434688, 15253073982785024, 113094845314640896

Offset: 0

Klaus Brockhaus, Aug 17 2009

Binomial transform of A164301. Sixth binomial transform of A164587. Inverse binomial transform of A164599.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 -2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 -2)*x^2) and have a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 11 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000 (terms 0..100 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (12,-34).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), A164300 (m=3), A164301 (m=4), this sequence (m=5), A164599 (m=6), A081185 (m=7), A164600 (m=8).

Cf. A081183, A147957, A164587.

[ n le 2 select 13*n-12 else 12*Self(n-1)-34*Self(n-2): n in [1..30] ];

m:=30; S:=series( (1+2*x)/(1-12*x+34*x^2), x, m+1):
seq(coeff(S, x, j), j=0..m); # G. C. Greubel, Mar 11 2021

LinearRecurrence[{12,-34}, {1,14}, 30] (* G. C. Greubel, Aug 11 2017 *)

my(x='x+O('x^30)); Vec((1+2*x)/(1-12*x+34*x^2)) \\ G. C. Greubel, Aug 11 2017

[( (1+2*x)/(1-12*x+34*x^2) ).series(x,n+1).list()[n] for n in (0..30)] # G. C. Greubel, Mar 11 2021

a(n) = ((1+4*sqrt(2))*(6+sqrt(2))^n + (1-4*sqrt(2))*(6-sqrt(2))^n)/2.
G.f.: (1+2*x)/(1-12*x+34*x^2).
E.g.f.: exp(6*x)*(cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x)). - G. C. Greubel, Aug 11 2017
From G. C. Greubel, Mar 11 2021: (Start)
a(n) = A147957(n) + 8*A081183(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*5^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

A164599 a(n) = 14a(n-1) - 47a(n-2), for n > 1, with a(0) = 1, a(1) = 15.

Original entry on oeis.org

1, 15, 163, 1577, 14417, 127719, 1110467, 9543745, 81420481, 691330719, 5851867459, 49433600633, 417032638289, 3515077706295, 29610553888547, 249339102243793, 2099051398651393, 17667781775661231, 148693529122641763

Offset: 0

Klaus Brockhaus, Aug 17 2009

nonn

Binomial transform of A164598. Seventh binomial transform of A164587. Inverse binomial transform of A081185 without initial term 0.

This sequence is part of a class of sequences defined by the recurrence a(n,m) = 2*(m+1)*a(n-1,m) - ((m+1)^2 -2)*a(n-2,m) with a(0) = 1 and a(1) = m+9. The generating function is Sum_{n>=0} a(n,m)*x^n = (1 - (m-7)*x)/(1 - 2*(m+1)*x + ((m+1)^2 -2)*x^2) and have a series expansion in terms of Pell-Lucas numbers defined by a(n, m) = (1/2)*Sum_{k=0..n} binomial(n,k)*m^(n-k)*(5*Q(k) + 4*Q(k-1)). - G. C. Greubel, Mar 11 2021

G. C. Greubel, Table of n, a(n) for n = 0..1000 (terms 0..100 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (14,-47).

Sequences in the class a(n, m): A164298 (m=1), A164299 (m=2), A164300 (m=3), A164301 (m=4), A164598 (m=5), this sequence (m=6), A081185 (m=7), A164600 (m=8).

Cf. A002203, A081184, A081185, A147958, A164587.

[ n le 2 select 14*n-13 else 14*Self(n-1)-47*Self(n-2): n in [1..30] ];

m:=30; S:=series( (1+x)/(1-14*x+47*x^2), x, m+1):
seq(coeff(S, x, j), j=0..m); # G. C. Greubel, Mar 11 2021

LinearRecurrence[{14,-47}, {1,15}, 30] (* G. C. Greubel, Aug 11 2017 *)

my(x='x+O('x^30)); Vec((1+x)/(1-14*x+47*x^2)) \\ G. C. Greubel, Aug 11 2017

def A164599_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+x)/(1-14*x+47*x^2) ).list()
A164599_list(30) # G. C. Greubel, Mar 11 2021

a(n) = ((1+4*sqrt(2))*(7+sqrt(2))^n + (1-4*sqrt(2))*(7-sqrt(2))^n)/2.
G.f.: (1+x)/(1-14*x+47*x^2).
E.g.f.: exp(7*x)*(cosh(sqrt(2)*x) + 4*sqrt(2)*sinh(sqrt(2)*x)). - G. C. Greubel, Aug 11 2017
From G. C. Greubel, Mar 11 2021: (Start)
a(n) = A147958(n) + 8*A081184(n).
a(n) = (1/2)*Sum_{k=0..n} binomial(n,k)*6^(n-k)*(5*Q(k) + 4*Q(k-1)), where Q(n) = Pell-Lucas(n) = A002203(n). (End)

A048696 Generalized Pellian with second term equal to 9.

Original entry on oeis.org

1, 9, 19, 47, 113, 273, 659, 1591, 3841, 9273, 22387, 54047, 130481, 315009, 760499, 1836007, 4432513, 10701033, 25834579, 62370191, 150574961, 363520113, 877615187, 2118750487, 5115116161, 12348982809, 29813081779, 71975146367

Offset: 0

Barry E. Williams

Binomial transform of 5,6,10,12,20,24,40. - Al Hakanson (hawkuu(AT)gmail.com), Aug 12 2009
Binomial transform of A164587. Inverse binomial transform of A164298. - Klaus Brockhaus, Aug 17 2009
For n > 0: a(n) = A105082(n) - A105082(n-1). - Reinhard Zumkeller, Dec 15 2013

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (2,1).

Cf. A001333, A000129, A048654, A048655.

a048696 n = a048696_list !! n
a048696_list = 1 : 9 : zipWith (+)
               a048696_list (map (2 *) $ tail a048696_list)
-- Reinhard Zumkeller, Dec 15 2013

[ n le 2 select 8*n-7 else 2*Self(n-1)+Self(n-2): n in [1..28] ]; // Klaus Brockhaus, Aug 17 2009

with(combinat): a:=n->7*fibonacci(n, 2)+fibonacci(n+1, 2): seq(a(n), n=0..25); # Zerinvary Lajos, Apr 04 2008

a[n_]:=(MatrixPower[{{1,2},{1,1}},n].{{8},{1}})[[2,1]]; Table[a[n],{n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2010 *)
LinearRecurrence[{2,1},{1,9},30] (* Harvey P. Dale, Apr 20 2012 *)

a[0]:1$
a[1]:9$
a[n]:=2*a[n-1]+a[n-2]$
A048696(n):=a[n]$
makelist(A048696(n),n,0,30); /* Martin Ettl, Nov 03 2012 */

a(n) = 2*a(n-1) + a(n-2); a(0)=1, a(1)=9.
a(n) = ((4*sqrt(2)+1)(1+sqrt(2))^n - (4*sqrt(2)-1)(1-sqrt(2))^n)/2.
G.f.: (1+7*x)/(1 - 2*x - x^2). - Philippe Deléham, Nov 03 2008

cp's OEIS Frontend

A081185 8th binomial transform of (0,1,0,2,0,4,0,8,0,16,...).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Sage

Formula

A164587 a(n) = 2*a(n - 2) for n > 2; a(1) = 1, a(2) = 8.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A164600 a(n) = 18*a(n-1) - 79*a(n-2) for n > 1; a(0) = 1, a(1) = 17.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A164299 a(n) = ((1+4*sqrt(2))*(3+sqrt(2))^n + (1-4*sqrt(2))*(3-sqrt(2))^n)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A164300 a(n) = ((1+4*sqrt(2))*(4+sqrt(2))^n + (1-4*sqrt(2))*(4-sqrt(2))^n)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

Extensions

A164301 a(n) = ((1+4*sqrt(2))*(5+sqrt(2))^n + (1-4*sqrt(2))*(5-sqrt(2))^n)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

A164600 a(n) = 18a(n-1) - 79a(n-2) for n > 1; a(0) = 1, a(1) = 17.

A164299 a(n) = ((1+4sqrt(2))(3+sqrt(2))^n + (1-4sqrt(2))(3-sqrt(2))^n)/2.

A164300 a(n) = ((1+4sqrt(2))(4+sqrt(2))^n + (1-4sqrt(2))(4-sqrt(2))^n)/2.

A164301 a(n) = ((1+4sqrt(2))(5+sqrt(2))^n + (1-4sqrt(2))(5-sqrt(2))^n)/2.

A164598 a(n) = 12a(n-1) - 34a(n-2), for n > 1, with a(0) = 1, a(1) = 14.

A164599 a(n) = 14a(n-1) - 47a(n-2), for n > 1, with a(0) = 1, a(1) = 15.