A108306 -id:A108306 - cp's OEIS frontend

A084057 a(n) = 2a(n-1) + 4a(n-2), a(0)=1, a(1)=1.

1, 1, 6, 16, 56, 176, 576, 1856, 6016, 19456, 62976, 203776, 659456, 2134016, 6905856, 22347776, 72318976, 234029056, 757334016, 2450784256, 7930904576, 25664946176, 83053510656, 268766806016, 869747654656, 2814562533376, 9108115685376, 29474481504256

Offset: 0

Paul Barry, May 10 2003

Inverse binomial transform of A001077. Binomial transform of expansion of cosh(sqrt(5)*x) (1,0,5,0,25,...).
The same sequence may be obtained by the following process. Starting a priori with the fraction 1/1, the numerators of fractions built according to the rule: add top and bottom to get the new bottom, add top and 5 times the bottom to get the new top. The limit of the sequence of fractions is sqrt(5). - Cino Hilliard, Sep 25 2005
Numerators of fractions in the approximation of the square root of 5 satisfying: a(n) = (a(n-1)+c)/(a(n-1)+1), with c=5 and a(1)=1. For denominators see A063727. - Mark Dols, Jul 24 2009
Equals right border of triangle A143969. (1, 6, 16, 56, ...) = row sums of triangle A143969 and INVERT transform of (1, 5, 5, 5, ...). - Gary W. Adamson, Sep 06 2008
a(n) is the number of compositions of n when there are 1 type of 1 and 5 types of other natural numbers. - Milan Janjic, Aug 13 2010
From Gary W. Adamson, Jul 30 2016: (Start)
The sequence is case N=1 in an infinite set obtained by taking powers of the 2 X 2 matrix M = [(1,5); (1,N)], then extracting the upper left terms. The infinite set begins:
N=1 (A084057):  1, 6, 16,  56,  176,   576,   1856, ...
N=2 (A108306):  1, 6, 21,  81,  306,  1161,   4401, ...
N=3 (A164549):  1, 6, 26, 116,  516,  2296,  10216, ...
N=4 (A015449):  1, 6, 31, 161,  836,  4341,  22541, ...
N=5 (A000400):  1, 6, 36, 216, 1296,  7776,  46656, ...
N=6 (A049685):  1, 6, 41, 281, 1926, 13201,  90481, ...
N=7 (.......):  1, 6, 46, 356, 2756, 21336, 222712, ...
...
Sequences in the above set can be obtained by taking INVERT transforms of the following:
N=1 INVERT transform of (1, 5,  5,  5,   5,    5, ...
N=2 ..."......"......". (1, 5, 10, 20,  40,   80, ...
N=3 ..."......"......". (1, 5, 15, 45, 135,  405, ...
N=4 ..."......"......". (1, 5, 20, 80, 320, 1280, ...
...
with the pattern (1, 5, N*5, (N^2)*5, (N^3)*5, ...
It appears that the sequence generated from powers (n>0) of the matrix P = [(1,a); (1,b)], (a,b > 0), then extracting the upper left terms, is equal to the INVERT transform of the sequence starting: (1, a, b*a, (b^2)*a, (b^3)*a, ...). (End)

John Derbyshire, Prime Obsession, Joseph Henry Press, April 2004, see p. 16.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (2,4).

Cf. A046717, A002533, A098158, A143969, A269992.
a(n) = A087131(n)/2.
The following sequences (and others) belong to the same family: A001333, A000129, A026150, A002605, A046717, A015518, A084057, A063727, A002533, A002532, A083098, A083099, A083100, A015519.
Cf. A108306, A164549, A015449, A000400, A049685

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

f[n_] := Simplify[((1 + Sqrt[5])^n + (1 - Sqrt[5])^n)/2]; Array[f, 28, 0] (* Or *)
LinearRecurrence[{2, 4}, {1, 1}, 28] (* Robert G. Wilson v, Sep 18 2013 *)
RecurrenceTable[{a[1] == 1, a[2] == 1, a[n] == 2 a[n-1] + 4 a[n-2]}, a, {n, 30}] (* Vincenzo Librandi, Jul 31 2016 *)
Table[2^(n-1) LucasL[n], {n, 0, 20}] (* Vladimir Reshetnikov, Sep 19 2016 *)

lucas(n)=fibonacci(n-1)+fibonacci(n+1)
a(n)=lucas(n)/2*2^n \\ Charles R Greathouse IV, Sep 18 2013

from sage.combinat.sloane_functions import recur_gen2b; it = recur_gen2b(1,1,2,4, lambda n: 0); [next(it) for i in range(1,26)] # Zerinvary Lajos, Jul 09 2008

[lucas_number2(n,2,-4)/2 for n in range(0, 26)] # Zerinvary Lajos, Apr 30 2009

a(n) = ((1+sqrt(5))^n + (1-sqrt(5))^n)/2.
G.f.: (1-x) / (1-2*x-4*x^2).
E.g.f.: exp(x) * cosh(sqrt(5)*x).
a(2n+1) = 2*a(n)*a(n+1) - (-4)^n. - Mario Catalani (mario.catalani(AT)unito.it), Jun 13 2003
a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2*k)*5^k . - Paul Barry, Jul 25 2004
a(n) = Sum_{k=0..n} A098158(n,k)*5^(n-k). - Philippe Deléham, Dec 26 2007
a(n) = 2^(n-1)*A000032(n). - Mark Dols, Jul 24 2009
If p(1)=1, and p(i)=5 for i>1, and if A is the Hessenberg matrix of order n defined by: A(i,j) = p(j-i+1) for i<=j, A(i,j):=-1, (i=j+1), and A(i,j):=0 otherwise, then, for n>=1, a(n)=det A. - Milan Janjic, Apr 29 2010
G.f.: G(0)/2, where G(k) = 1 + 1/(1 - x*(5*k-1)/(x*(5*k+4) - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 26 2013
a(n) = A063727(n) - A063272(n-1). - R. J. Mathar, Jun 06 2019
a(n) = 1 + 5*A014335(n). - R. J. Mathar, Jun 06 2019
Sum_{n>=1} 1/a(n) = A269992. - Amiram Eldar, Feb 01 2021

A015449 Expansion of (1-4x)/(1-5x-x^2).

Original entry on oeis.org

1, 1, 6, 31, 161, 836, 4341, 22541, 117046, 607771, 3155901, 16387276, 85092281, 441848681, 2294335686, 11913527111, 61861971241, 321223383316, 1667978887821, 8661117822421, 44973567999926, 233528957822051

Offset: 0

Olivier Gérard

Row m=5 of A135597.
Binomial transform of A152187. - Johannes W. Meijer, Aug 01 2010
For n>=1, row sums of triangle
m/k.|..0.....1.....2.....3.....4.....5.....6.....7
==================================================
.0..|..1
.1..|..1.....5
.2..|..1.....5....25
.3..|..1....10....25.....125
.4..|..1....10....75.....125....625
.5..|..1....15....75.....500....625....3125
.6..|..1....15...150.....500...3125....3125...15625
.7..|..1....20...150....1250...3125...18750...15625...78125
which is triangle for numbers 5^k*C(m,k) with duplicated diagonals. - Vladimir Shevelev, Apr 12 2012
a(n+1) is (for n>=0) the number of length-n strings of 6 letters {0,1,2,3,4,5} with no two adjacent nonzero letters identical. The general case (strings of L letters) is the sequence with g.f. (1+x)/(1-(L-1)*x-x^2). - Joerg Arndt, Oct 11 2012
With offset 1, the sequence is the INVERT transform (1, 5, 5*4, 5*4^2, 5*4^3, ...); i.e., of A003947. The sequence can also be obtained by taking powers of the matrix [(1,5); (1,4)] and extracting the upper left terms. - Gary W. Adamson, Jul 31 2016

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Joerg Arndt, Matters Computational (The Fxtbook)
Taras Goy and Mark Shattuck, Determinants of Toeplitz-Hessenberg Matrices with Generalized Leonardo Number Entries, Ann. Math. Silesianae (2023). See p. 16.
Milan Janjic, On Linear Recurrence Equations Arising from Compositions of Positive Integers, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.7.
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (5,1).

Cf. A084057, A108306, A164549.

a:=[1,1];; for n in [3..30] do a[n]:=5*a[n-1]+a[n-2]; od; a; # G. C. Greubel, Oct 23 2019

[n le 2 select 1 else 5*Self(n-1)+Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 06 2012

a[0]:=1: a[1]:=1: for n from 2 to 26 do a[n]:=5*a[n-1]+a[n-2] od: seq(a[n], n=0..21); # Zerinvary Lajos, Jul 26 2006

Transpose[NestList[Flatten[{Rest[#],ListCorrelate[{1,5},#]}]&, {1,1},40]][[1]]  (* Harvey P. Dale, Mar 23 2011 *)
LinearRecurrence[{5,1}, {1,1}, 30] (* Vincenzo Librandi, Nov 06 2012 *)
CoefficientList[Series[(1-4*x)/(1-5*x-x^2), {x,0,30}], x] (* G. C. Greubel, Dec 19 2017 *)
Sum[Fibonacci[Range[30] +k-2, 5], {k,0,1}] (* G. C. Greubel, Oct 23 2019 *)

Vec((1-4*x)/(1-5*x-x^2) +O('x^30)) \\ _G. C. Greubel, Dec 19 2017

def A015449_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P((1-4*x)/(1-5*x-x^2)).list()
A015449_list(30) # G. C. Greubel, Oct 23 2019

a(n) = 5*a(n-1) + a(n-2).
a(n) = Sum_{k=0..n} 4^k*A055830(n,k). - Philippe Deléham, Oct 18 2006
G.f.: (1-4*x)/(1-5*x-x^2). - Philippe Deléham, Nov 20 2008
For n >= 2, a(n) = F_n(5) + F_(n+1)(5), where F_n(x) is Fibonacci polynomial (cf. A049310): F_n(x) = Sum_{i=0..floor((n-1)/2)} C(n-i-1,i)*x^(n-2*i-1). - Vladimir Shevelev, Apr 13 2012
a(n) = Sum_{k=0..n} A046854(n-1,k)*5^k. - R. J. Mathar, Feb 10 2024

A164549 a(n) = 4a(n-1) + 2a(n-2) for n > 1; a(0) = 1, a(1) = 6.

Original entry on oeis.org

1, 6, 26, 116, 516, 2296, 10216, 45456, 202256, 899936, 4004256, 17816896, 79276096, 352738176, 1569504896, 6983495936, 31072993536, 138258966016, 615181851136, 2737245336576, 12179345048576, 54191870867456

Offset: 0

Klaus Brockhaus, Aug 15 2009

nonn

Binomial transform of A123011. Inverse binomial transform of A164550.
INVERT transform of the sequence (1, 5, 5*3, 5*3^2, 5*3^3, 5*3^4, ...); i.e., of (1, 5, 15, 45, 135, 405, ...). The sequence can also be obtained by extracting the upper left terms in matrix powers of [(1,5); (1,3)]. - Gary W. Adamson, Jul 31 2016
The sequence is A090017 (1, 4, 18, 80, 356, ...) convolved with (1, 2, 0, 0, 0, ...). Also, the upper left terms extracted from matrix powers of [(1,5); (1,3)]. - Gary W. Adamson, Aug 20 2016

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

Cf. A123011, A164550.

Cf. A084057, A108306.

[ n le 2 select 5*n-4 else 4*Self(n-1)+2*Self(n-2): n in [1..22] ];

LinearRecurrence[{4,2},{1,6},30] (* Harvey P. Dale, Mar 16 2013 *)
CoefficientList[Series[(1 +2x)/(1 -4x -2x^2), {x, 0, 24}], x] (* Michael De Vlieger, Aug 02 2016 *)

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

[(i*sqrt(2))^n*(chebyshev_U(n, -i*sqrt(2)) - sqrt(2)*i*chebyshev_U(n-1, -i*sqrt(2))) for n in (0..30)] # G. C. Greubel, Jul 16 2021

a(n) = ((3+2*sqrt(6))*(2+sqrt(6))^n + (3-2*sqrt(6))*(2-sqrt(6))^n)/6.
G.f.: (1+2*x)/(1-4*x-2*x^2).
a(n) = (i*sqrt(2))^n*(ChebyshevU(n, -i*sqrt(2)) - sqrt(2)*i*ChebyshevU(n-1, -i*sqrt(2))). - G. C. Greubel, Jul 16 2021

A196472 a(1)=1; a(n) = floor((3 + sqrt(21))*a(n-1)/2) for n > 1.

Original entry on oeis.org

1, 3, 11, 41, 155, 587, 2225, 8435, 31979, 121241, 459659, 1742699, 6607073, 25049315, 94969163, 360055433, 1365073787, 5175387659, 19621384337, 74390315987, 282035100971, 1069276250873, 4053934055531, 15369630919211, 58270694924225, 220920977530307, 837575017363595

Offset: 1

Philippe Deléham, Oct 03 2011

Contains only odd numbers.

Vincenzo Librandi, Table of n, a(n) for n = 1..150
Index entries for linear recurrences with constant coefficients, signature (4,0,-3).

Cf. A108306.

I:=[1,3,11]; [n le 3 select I[n] else 4*Self(n-1)-3*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Oct 05 2011

With[{c=(3+Sqrt[21])/2},NestList[Floor[c*#]&,1,30]] (* Harvey P. Dale, Apr 23 2014 *)

G.f.: -x*(-1+ x + x ^2) / ( (x-1)*(3*x^2 + 3*x - 1) ). - R. J. Mathar, Oct 04 2011

a(n) = (3 + 2*A108306(n))/15. - R. J. Mathar, Oct 04 2011

A103820 Whitney transform of 3^n.

Original entry on oeis.org

1, 4, 16, 61, 232, 880, 3337, 12652, 47968, 181861, 689488, 2614048, 9910609, 37573972, 142453744, 540083149, 2047610680, 7763081488, 29432076505, 111585473980, 423052651456, 1603914376309, 6080901083296, 23054446378816

Offset: 0

Paul Barry, Feb 16 2005

Partial sums of A030195. The Whitney transform maps the sequence with g.f. g(x) to that with g.f. (1/(1-x))g(x(1+x)).

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,0,-3).

Cf. A004070, A030195.

Equals (A108306(n+1) - 1)/5.

I:=[1,4,16]; [n le 3 select I[n] else 4*Self(n-1)-3*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Aug 18 2017

a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=3*a[n-1]+3*a[n-2]+1 od: seq(a[n], n=1..33); # Zerinvary Lajos, Dec 14 2008

Join[{a=0,b=1},Table[c=3*b+3*a+1;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 17 2011 *)
LinearRecurrence[{4, 0, -3}, {1, 4, 16}, 40] (* Vincenzo Librandi, Aug 18 2017 *)

G.f.: 1/((1-x)(1-3x-3x^2));
a(n) = 4a(n-1) - 3a(n-3);
a(n) = Sum_{k=0..n} (Sum_{i=0..n} C(k, i-k))*3^k.
a(n) = 3(a(n-1) + a(n-2)) + 1, n > 1. [Gary Detlefs, Jun 21 2010]

A134927 a(0)=a(1)=1; a(n) = 3*(a(n-1) + a(n-2)).

Original entry on oeis.org

1, 1, 6, 21, 81, 306, 1161, 4401, 16686, 63261, 239841, 909306, 3447441, 13070241, 49553046, 187869861, 712268721, 2700415746, 10238053401, 38815407441, 147160382526, 557927369901, 2115263257281, 8019571881546, 30404505416481

Offset: 0

Rolf Pleisch, Jan 29 2008

Joshua Zucker, Feb 23 2008, Table of n, a(n) for n = 0..50
Index entries for linear recurrences with constant coefficients, signature (3,3).

Essentially the same as A108306.

a[0]:=1:a[1]:=1:for n from 2 to 50 do a[n]:=3*a[n-1]+3*a[n-2] od: seq(a[n], n=0..33); # Zerinvary Lajos, Dec 14 2008

Mathematica
```
LinearRecurrence[{3, 3}, {1, 1}, 30]
```

a=[1,1];for(i=2,10,a=concat(a,3*a[#a]+3*a[#a-1]));a \\ Charles R Greathouse IV, Oct 04 2011

from sage.combinat.sloane_functions import recur_gen2
it = recur_gen2(1,1,3,3)
[next(it) for i in range(25)] # Zerinvary Lajos, Jun 25 2008

From R. J. Mathar, Jan 31 2008: (Start)
O.g.f.: (-1+2*x)/(-1 + 3*x + 3*x^2).
a(n) = A030195(n+1)-2*A030195(n). (End)
a(n) = A108306(n-1), n>0. - R. J. Mathar, Oct 04 2011
a(n) ~ 3.7912878474...^n, where the constant is A090458. - Charles R Greathouse IV, Oct 04 2011

More terms from Joshua Zucker, Feb 23 2008

A238160 A skewed version of triangular array A029653.

Original entry on oeis.org

1, 0, 2, 0, 1, 2, 0, 0, 3, 2, 0, 0, 1, 5, 2, 0, 0, 0, 4, 7, 2, 0, 0, 0, 1, 9, 9, 2, 0, 0, 0, 0, 5, 16, 11, 2, 0, 0, 0, 0, 1, 14, 25, 13, 2, 0, 0, 0, 0, 0, 6, 30, 36, 15, 2, 0, 0, 0, 0, 0, 1, 20, 55, 49, 17, 2, 0, 0, 0, 0, 0, 0, 7, 50, 91, 64, 19, 2, 0, 0, 0, 0, 0

Offset: 0

Philippe Deléham, Feb 18 2014

Triangle T(n,k), 0<=k<=n, read by rows, given by (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (2, -1, 0, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
Row sums are Fib(n+2).
Column sums are A003945(k).
Diagonal sums are (-1)^(n+1)*A109266(n+1).
T(3*n,2*n) = A029651(n).

			Triangle begins:
1;
0, 2;
0, 1, 2;
0, 0, 3, 2;
0, 0, 1, 5, 2;
0, 0, 0, 4, 7, 2;
0, 0, 0, 1, 9, 9, 2;
0, 0, 0, 0, 5, 16, 11, 2;
0, 0, 0, 0, 1, 14, 25, 13, 2;
0, 0, 0, 0, 0, 6, 30, 36, 15, 2;
0, 0, 0, 0, 0, 1, 20, 55, 49, 17, 2;
0, 0, 0, 0, 0, 0, 7, 50, 91, 64, 19, 2;
...

Cf. A029635, A029653, A178524.

G.f.: (1+x*y)/(1-x*y-x^2*y).
T(n,k) = T(n-1,k-1) + T(n-2,k-1), T(0,0) = 1, T(1,0) = 0, T(1,1) = 2, T(n,k) = 0 if k<0 or if k>n.
Sum_{k=0..n} T(n,k)*x^k = A000007(n), A000045(n+2), A026150(n+1), A108306(n), A164545(n), A188168(n+1) for x = 0, 1, 2, 3, 4, 5 respectively.

cp's OEIS Frontend

A084057 a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=1.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Sage

Formula

A015449 Expansion of (1-4*x)/(1-5*x-x^2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Sage

Formula

A196472 a(1)=1; a(n) = floor((3 + sqrt(21))*a(n-1)/2) for n > 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A103820 Whitney transform of 3^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

A134927 a(0)=a(1)=1; a(n) = 3*(a(n-1) + a(n-2)).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

Extensions

A084057 a(n) = 2a(n-1) + 4a(n-2), a(0)=1, a(1)=1.

A015449 Expansion of (1-4x)/(1-5x-x^2).

A164549 a(n) = 4a(n-1) + 2a(n-2) for n > 1; a(0) = 1, a(1) = 6.