A005668 -id:A005668 - cp's OEIS frontend

A367298 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 4x, p(n,x) = up(n-1,x) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2x - x^2.

1, 2, 4, 5, 14, 15, 12, 48, 76, 56, 29, 148, 326, 372, 209, 70, 436, 1212, 1904, 1718, 780, 169, 1242, 4169, 8228, 10191, 7642, 2911, 408, 3456, 13576, 32176, 49992, 51488, 33112, 10864, 985, 9448, 42492, 117304, 218254, 281976, 249612, 140712, 40545

Offset: 1

Clark Kimberling, Nov 26 2023

Because (p(n,x)) is a strong divisibility sequence, for each integer k, the sequence (p(n,k)) is a strong divisibility sequence of integers.

			First eight rows:
    1
    2     4
    5    14     15
   12    48     76     56
   29   148    326    372    209
   70   436   1212   1904   1718   780
  169  1242   4169   8228  10191  7642    2911
  408  3456  13576  32176  49992  51488  33112  10864
Row 4 represents the polynomial p(4,x) = 12 + 48*x + 76*x^2 + 56*x^3, so (T(4,k)) = (12,48,76,56), k=0..3.

Rigoberto Flórez, Robinson Higuita, and Antara Mukherjee, Characterization of the strong divisibility property for generalized Fibonacci polynomials, Integers, 18 (2018), Paper No. A14.

Cf. A000129 (column 1), A001353 (p(n,n-1)), A154244 (row sums, p(n,1)), A002605 (alternating row sums, p(n,-1)), A190989 (p(n,2)), A005668 (p(n,-2)), A190869 (p(n,-3)), A094440, A367208, A367209, A367210, A367211, A367297, A367299, A367300, A367301.

p[1, x_] := 1; p[2, x_] := 2 + 4 x; u[x_] := p[2, x]; v[x_] := 1 - 2 x - x^2;
p[n_, x_] := Expand[u[x]*p[n - 1, x] + v[x]*p[n - 2, x]]
Grid[Table[CoefficientList[p[n, x], x], {n, 1, 10}]]
Flatten[Table[CoefficientList[p[n, x], x], {n, 1, 10}]]

p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where p(1,x) = 1, p(2,x) = 2 + 4*x, u = p(2,x), and v = 1 - 2*x - x^2.

p(n,x) = k*(b^n - c^n), where k = -(1/sqrt(8 + 8*x + 12*x^2)), b = (1/2)*(4*x + 2 + 1/k), c = (1/2)*(4*x + 2 - 1/k).

A243399 a(0) = 1, a(1) = 19; for n > 1, a(n) = 19*a(n-1) + a(n-2).

Original entry on oeis.org

1, 19, 362, 6897, 131405, 2503592, 47699653, 908796999, 17314842634, 329890807045, 6285240176489, 119749454160336, 2281524869222873, 43468721969394923, 828187242287726410, 15779026325436196713, 300629687425575463957, 5727743087411370011896

Offset: 0

Bruno Berselli, Jun 04 2014

a(n+1)/a(n) tends to (19 + sqrt(365))/2.
a(n) equals the number of words of length n on alphabet {0,1,...,19} avoiding runs of zeros of odd lengths. - Milan Janjic, Jan 28 2015
From Michael A. Allen, May 03 2023: (Start)
Also called the 19-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence.
a(n) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 19 kinds of squares available. (End)

Bruno Berselli, Table of n, a(n) for n = 0..200
Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
Tanya Khovanova, Recursive Sequences.
Eric Weisstein's World of Mathematics, Fibonacci Polynomial.
Index entries for linear recurrences with constant coefficients, signature (19,1).

Row n=19 of A073133, A172236 and A352361 and column k=19 of A157103.

Sequences with g.f. 1/(1-k*x-x^2) or x/(1-k*x-x^2): A000045 (k=1), A000129 (k=2), A006190 (k=3), A001076 (k=4), A052918 (k=5), A005668 (k=6), A054413 (k=7), A041025 (k=8), A099371 (k=9), A041041 (k=10), A049666 (k=11), A041061 (k=12), A140455 (k=13), A041085 (k=14), A154597 (k=15), A041113 (k=16), A178765 (k=17), A041145 (k=18), this sequence (k=19), A041181 (k=20). Also, many other sequences are in the OEIS with even k greater than 20 (denominators of continued fraction convergents to sqrt((k/2)^2+1)).

[n le 2 select 19^(n-1) else 19*Self(n-1)+Self(n-2): n in [1..20]];

RecurrenceTable[{a[n] == 19 a[n - 1] + a[n - 2], a[0] == 1, a[1] == 19}, a, {n, 0, 20}]

a[0]:1$ a[1]:19$ a[n]:=19*a[n-1]+a[n-2]$ makelist(a[n], n, 0, 20);

v=vector(20); v[1]=1; v[2]=19; for(i=3, #v, v[i]=19*v[i-1]+v[i-2]); v

from sage.combinat.sloane_functions import recur_gen2
a = recur_gen2(1,19,19,1)
[next(a) for i in (0..20)]

G.f.: 1/(1 - 19*x - x^2).
a(n) = (-1)^n*a(-n-2) = ((19 + sqrt(365))^(n+1)-(19 - sqrt(365))^(n+1))/(2^(n+1)*sqrt(365)).
a(n) = F(n+1, 19), the (n+1)-th Fibonacci polynomial evaluated at x = 19.
a(n)*a(n-2) - a(n-1)^2 = (-1)^n, with a(-2)=1, a(-1)=0.

A140455 13-Fibonacci sequence.

Original entry on oeis.org

0, 1, 13, 170, 2223, 29069, 380120, 4970629, 64998297, 849948490, 11114328667, 145336221161, 1900485203760, 24851643870041, 324971855514293, 4249485765555850, 55568286807740343, 726637214266180309

Offset: 0

R. J. Mathar, Jul 22 2008

The k-Fibonacci sequences for k=2..12 are A000129, A006190, A001076, A052918, A005668, A054413, A041025, A099371, A041041, A049666, A041061. This here is k=13. k=14 is A041085, k=16 A041113, k=18 A041145, k=20 A041181, k=22 A041221.
For more information about this type of recurrence follow the Khovanova link and see A054413, A086902 and A178765. - Johannes W. Meijer, Jun 12 2010
For n>=2, a(n) equals the permanent of the (n-1) X (n-1) tridiagonal matrix with 13's along the main diagonal and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
For n>=1, a(n) equals the number of words of length n-1 on alphabet {0,1,...,13} avoiding runs of zeros of odd length. - Milan Janjic, Jan 28 2015
From Michael A. Allen, Apr 21 2023: (Start)
Also called the 13-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence.
a(n+1) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 13 kinds of squares available. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..900
Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
Sergio Falcon and Angel Plaza, The k-Fibonacci sequence and Pascal 2-triangle, Chaos, Solit. Fract. 33 (2007) 38-49.
Tanya Khovanova, Recursive sequences.
Index entries for linear recurrences with constant coefficients, signature (13,1).

Row n=13 of A073133, A172236 and A352361 and column k=13 of A157103.

F := proc(n,k) coeftayl( x/(1-k*x-x^2),x=0,n) ; end: for n from 0 to 20 do printf("%d,",F(n,13)) ; od:

LinearRecurrence[{13, 1}, {0, 1}, 30] (* Vincenzo Librandi, Nov 17 2012 *)

[lucas_number1(n,13,-1) for n in range(0, 18)] # Zerinvary Lajos, Apr 29 2009

O.g.f.: x/(1-13*x-x^2).
a(n) = 13*a(n-1) + a(n-2).
a(n-r)*a(n+r) - a(n)^2 = (-1)^(n+1-r)*a(r)^2.
a(n) = Sum_{i=0..floor((n-1)/2)} binomial(n,2i+1)*13^(n-1-2*i)*(13^2+4)^i/2^(n-1).
a(n) = ((13+sqrt(173))^n - (13-sqrt(173))^n)/(2^n*sqrt(173)). - Al Hakanson (hawkuu(AT)gmail.com), Jan 12 2009
From Johannes W. Meijer, Jun 12 2010: (Start)
a(2*n) = 13*A097844(n), a(2*n+1) = A098244(n).
a(3*n+1) = A041319(5*n), a(3*n+2) = A041319(5*n+3), a(3*n+3) = 2*A041319(5*n+4).
Limit_{k->oo} a(n+k)/a(k) = (A088316(n) + A140455(n)*sqrt(173))/2.
Limit_{n->oo} A088316(n)/A140455(n) = sqrt(173). (End)

A176398 Decimal expansion of 3+sqrt(10).

Original entry on oeis.org

6, 1, 6, 2, 2, 7, 7, 6, 6, 0, 1, 6, 8, 3, 7, 9, 3, 3, 1, 9, 9, 8, 8, 9, 3, 5, 4, 4, 4, 3, 2, 7, 1, 8, 5, 3, 3, 7, 1, 9, 5, 5, 5, 1, 3, 9, 3, 2, 5, 2, 1, 6, 8, 2, 6, 8, 5, 7, 5, 0, 4, 8, 5, 2, 7, 9, 2, 5, 9, 4, 4, 3, 8, 6, 3, 9, 2, 3, 8, 2, 2, 1, 3, 4, 4, 2, 4, 8, 1, 0, 8, 3, 7, 9, 3, 0, 0, 2, 9, 5, 1, 8, 7, 3, 4

Offset: 1

Klaus Brockhaus, Apr 16 2010

Continued fraction expansion of 3+sqrt(10) is A010722.
This is the shape of a 6-extension rectangle; see A188640 for definitions. - Clark Kimberling, Apr 09 2011
c^n = c*A005668(n) + A005668(n-1). - Gary W. Adamson, Apr 04 2024

			6.16227766016837933199...

Daniel Starodubtsev, Table of n, a(n) for n = 1..10000
Wikipedia, Metallic mean.
Index entries for algebraic numbers, degree 2

Cf. A010467 (decimal expansion of sqrt(10)), A010722 (all 6's sequence).

Cf. A049310.

Digits:=100; evalf(3+sqrt(10)); # Wesley Ivan Hurt, Mar 07 2014

r=6; t=(r+(4+r^2)^(1/2))/2; RealDigits[N[t,130]][[1]] (* Clark Kimberling, Apr 09 2011 *)

3+sqrt(10) \\ Charles R Greathouse IV, Jul 24 2013

a(n) = A010467(n) for n >= 2.
Equals exp(arcsinh(3)), since arcsinh(x) = log(x+sqrt(x^2+1)). - Stanislav Sykora, Nov 01 2013
Equals lim_{n->oo} S(n, 2*sqrt(10))/ S(n-1, 2*sqrt(10)), with the S-Chebyshev polynomials (see A049310). - Wolfdieter Lang, Nov 15 2023

A154597 a(n) = 15*a(n-1) + a(n-2) with a(0) = 0, a(1) = 1.

Original entry on oeis.org

0, 1, 15, 226, 3405, 51301, 772920, 11645101, 175449435, 2643386626, 39826248825, 600037119001, 9040383033840, 136205782626601, 2052127122432855, 30918112619119426, 465823816409224245, 7018275358757483101, 105739954197771470760, 1593117588325329544501

Offset: 0

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

Limit_{n -> infinity} a(n)/a(n-1) = (15 + sqrt(229))/2. - Klaus Brockhaus, Oct 07 2009
For more information about this type of recurrence follow the Khovanova link and see A054413, A086902 and A178765. - Johannes W. Meijer, Jun 12 2010
For n >= 2, a(n) equals the permanent of the (n-1) X (n-1) tridiagonal matrix with 15's along the main diagonal, and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
a(n) equals the number of words of length n - 1 on alphabet {0,1,...,15} avoiding runs of zeros of odd lengths. - Milan Janjic, Jan 28 2015
From Michael A. Allen, Apr 30 2023: (Start)
Also called the 15-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence.
a(n+1) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 15 kinds of squares available. (End)

G. C. Greubel, Table of n, a(n) for n = 0..840 (a(0) = 0 added by Jianing Song)
Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
Tanya Khovanova, Recursive sequences. [From _Johannes W. Meijer_, Jun 12 2010]
Index entries for linear recurrences with constant coefficients, signature (15,1).

Row n=15 of A073133, A172236 and A352361 and column k=15 of A157103.
First bisection is A098247.
Cf. A166125 (decimal expansion of sqrt(229)), A166126 (decimal expansion of (15 + sqrt(229))/2).
Cf. also A041427, A090301, A098245.
Sequences with g.f. 1/(1-k*x-x^2) or x/(1-k*x-x^2): A000045 (k=1), A000129 (k=2), A006190 (k=3), A001076 (k=4), A052918 (k=5), A005668 (k=6), A054413 (k=7), A041025 (k=8), A099371 (k=9), A041041 (k=10), A049666 (k=11), A041061 (k=12), A140455 (k=13), A041085 (k=14), this sequence (k=15), A041113 (k=16), A178765 (k=17), A041145 (k=18), A243399 (k=19), A041181 (k=20).

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

[n le 2 select n-1 else 15*Self(n-1) +Self(n-2): n in [1..30]]; // G. C. Greubel, Sep 20 2024

LinearRecurrence[{15,1}, {0,1}, 31] (* Vladimir Joseph Stephan Orlovsky, Oct 27 2009 *)
CoefficientList[Series[x/(1-15*x-x^2), {x,0,50}], x] (* G. C. Greubel, Apr 16 2017 *)

my(x='x+O('x^50)); concat([0], Vec(x/(1-15*x-x^2))) \\ G. C. Greubel, Apr 16 2017

def A154597(n): return (-i)^(n-1)*chebyshev_U(n-1, 15*i/2)
[A154597(n) for n in range(31)] # G. C. Greubel, Sep 20 2024

G.f.: x/(1 - 15*x - x^2). - Klaus Brockhaus, Jan 12 2009, corrected Oct 07 2009
a(n) = ((15 + sqrt(229))^n - (15 - sqrt(229))^n)/(2^n*sqrt(229)).
From Johannes W. Meijer, Jun 12 2010: (Start)
Limit_{k -> infinity} a(n+k)/a(k) = (A090301(n) + a(n)*sqrt(229))/2.
Limit_{n -> infinity} A090301(n)/a(n) = sqrt(229).
a(2n+1) = 15*A098245(n-1).
a(3n+1) = A041427(5n), a(3n+2) = A041427(5n+3), a(3n+3) = 2*A041427(5n+4). (End)
E.g.f.: (2/sqrt(229))*exp(15*x/2)*sinh(sqrt(229)*x/2). - G. C. Greubel, Sep 20 2024

Extended beyond a(7) by Klaus Brockhaus and Philippe Deléham, Jan 12 2009
Name from Philippe Deléham, Jan 12 2009
Edited by Klaus Brockhaus, Oct 07 2009
Missing a(0) added by Jianing Song, Jan 29 2019

A090018 a(n) = 6a(n-1) + 3a(n-2) for n > 2, a(0)=1, a(1)=6.

Original entry on oeis.org

1, 6, 39, 252, 1629, 10530, 68067, 439992, 2844153, 18384894, 118841823, 768205620, 4965759189, 32099171994, 207492309531, 1341251373168, 8669985167601, 56043665125110, 362271946253463, 2341762672896108, 15137391876137037, 97849639275510546, 632510011281474387

Offset: 0

Paul Barry, Nov 19 2003

From Johannes W. Meijer, Aug 09 2010: (Start)

a(n) represents the number of n-move routes of a fairy chess piece starting in a given corner or side square on a 3 X 3 chessboard. This fairy chess piece behaves like a white queen on the eight side and corner squares but on the central square the queen explodes with fury and turns into a red queen, see A180032. The central square leads to A180028. (End)

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (6,3).

Cf. A141041, A180028, A180032.

Sequences with g.f. of the form 1/(1 - 6*x - k*x^2): A106392 (k=-10), A027471 (k=-9), A006516 (k=-8), A081179 (k=-7), A030192 (k=-6), A003463 (k=-5), A084326 (k=-4), A138395 (k=-3), A154244 (k=-2), A001109 (k=-1), A000400 (k=0), A005668 (k=1), A135030 (k=2), this sequence (k=3), A135032 (k=4), A015551 (k=5), A057089 (k=6), A015552 (k=7), A189800 (k=8), A189801 (k=9), A190005 (k=10), A015553 (k=11).

[n le 2 select 6^(n-1) else 6*Self(n-1)+3*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 15 2011

a:= n-> (<<0|1>, <3|6>>^n. <<1,6>>)[1,1]:
seq(a(n), n=0..30);  # Alois P. Heinz, Jan 17 2011

Join[{a=1,b=6},Table[c=6*b+3*a;a=b;b=c,{n,100}]] (* Vladimir Joseph Stephan Orlovsky, Jan 16 2011 *)
LinearRecurrence[{6,3}, {1,6}, 41] (* G. C. Greubel, Oct 10 2022 *)

my(x='x+O('x^30)); Vec(1/(1-6*x-3*x^2)) \\ G. C. Greubel, Jan 24 2018

[lucas_number1(n,6,-3) for n in range(1, 31)] # Zerinvary Lajos, Apr 24 2009

a(n) = (3+2*sqrt(3))^n*(sqrt(3)/4+1/2) + (1/2-sqrt(3)/4)*(3-2*sqrt(3))^n.
a(n) = (-i*sqrt(3))^n * ChebyshevU(n, isqrt(3)), i^2=-1.
From Johannes W. Meijer, Aug 09 2010: (Start)
G.f.: 1/(1 - 6*x - 3*x^2).
Limit_{k->oo} a(n+k)/a(k) = A141041(n) + A090018(n-1)*sqrt(12) for n >= 1.
Limit_{n->oo} A141041(n)/A090018(n-1) = sqrt(12). (End)
a(n) = Sum_{k=0..n} A099089(n,k)*3^k. - Philippe Deléham, Nov 21 2011
E.g.f.: exp(3*x)*(2*cosh(2*sqrt(3)*x) + sqrt(3)*sinh(2*sqrt(3)*x))/2. - Stefano Spezia, Apr 23 2025

Typo in Mathematica program corrected by Vincenzo Librandi, Nov 15 2011

A180032 Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(1-5x-7x^2).

Original entry on oeis.org

1, 6, 37, 227, 1394, 8559, 52553, 322678, 1981261, 12165051, 74694082, 458625767, 2815987409, 17290317414, 106163498933, 651849716563, 4002393075346, 24574913392671, 150891318490777, 926480986202582, 5688644160448349

Offset: 0

Johannes W. Meijer, Aug 09 2010

The a(n) represent the number of n-move routes of a fairy chess piece starting in a given corner or side square (m = 1, 3, 7, 9; 2, 4, 6, 8) on a 3 X 3 chessboard. This fairy chess piece behaves like a white chess queen on the eight side and corner squares but on the central square the queen explodes with fury and turns into a red queen.
On a 3 X 3 chessboard there are 2^9 = 512 ways to explode with fury on the central square (we assume here that a red queen might behave like a white queen). The red queen is represented by the A[5] vector in the fifth row of the adjacency matrix A, see the Maple program. For the corner and side squares the 512 red queens lead to 17 red queen sequences, see the cross-references for the complete set.
The sequence above corresponds to 8 red queen vectors, i.e., A[5] vectors, with decimal values 239, 367, 431, 463, 487, 491, 493 and 494. The central square leads for these vectors to A152240.
This sequence belongs to a family of sequences with g.f. (1+x)/(1 - 5*x - k*x^2). The members of this family that are red queen sequences are A180030 (k=8), A180032 (k=7; this sequence), A000400 (k=6), A180033 (k=5), A126501 (k=4), A180035 (k=3), A180037 (k=2) A015449 (k=1) and A003948 (k=0). Other members of this family are A030221 (k=-1), A109114 (k=-3), A020989 (k=-4), A166060 (k=-6).
Inverse binomial transform of A054413.

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Wikipedia, Alice in Wonderland (2010 film)
Index entries for linear recurrences with constant coefficients, signature (5, 7).

Cf. A180028 (Central square).

Cf. Red queen sequences corner and side squares [decimal value A[5]]: A090018 [511], A135030 [255], A180030 [495], A005668 [127], A180032 [239], A000400 [63], A180033 [47], A001109 [31], A126501 [15], A154244 [23], A180035 [7], A138395 [19], A180037 [3], A084326 [17], A015449 [1], A003463 [16], A003948 [0].

I:=[1,6]; [n le 2 select I[n] else 5*Self(n-1)+7*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 15 2011

with(LinearAlgebra): nmax:=20; m:=1; A[5]:= [1,1,1,1,0,1,1,1,0]: A:=Matrix([[0,1,1,1,1,0,1,0,1], [1,0,1,1,1,1,0,1,0], [1,1,0,0,1,1,1,0,1], [1,1,0,0,1,1,1,1,0], A[5], [0,1,1,1,1,0,0,1,1], [1,0,1,1,1,0,0,1,1], [0,1,0,1,1,1,1,0,1], [1,0,1,0,1,1,1,1,0]]): for n from 0 to nmax do B(n):=A^n: a(n):= add(B(n)[m,k],k=1..9): od: seq(a(n), n=0..nmax);

LinearRecurrence[{5,7},{1,6},40] (* Vincenzo Librandi, Nov 15 2011 *)
CoefficientList[Series[(1+x)/(1-5x-7x^2),{x,0,30}],x] (* Harvey P. Dale, Apr 04 2024 *)

G.f.: (1+x)/(1 - 5*x - 7*x^2).
a(n) = 5*a(n-1) + 7*a(n-2) with a(0) = 1 and a(1) = 6.
a(n) = ((7+9*A)*A^(-n-1) + (7+9*B)*B^(-n-1))/53 with A = (-5+sqrt(53))/14 and B = (-5-sqrt(53))/14.

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

Original entry on oeis.org

1, 2, 13, 80, 493, 3038, 18721, 115364, 710905, 4380794, 26995669, 166354808, 1025124517, 6317101910, 38927735977, 239883517772, 1478228842609, 9109256573426, 56133768283165, 345911866272416, 2131604965917661, 13135541661778382, 80944854936587953

Offset: 0

Gary W. Adamson, Jul 04 2010

a(n)/a(n-1) converges to 1/(sqrt(10) - 3) = 6.16227766017... = A176398.

			a(5) = 3038 = 6*a(5) + a(4) = 6*493 + 80.
a(5) = term (1,1) in M^5 where M^5 = [3038, 4215, 4215, 5848].

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,1).

I:=[1,2]; [n le 2 select I[n] else 6*Self(n-1)+Self(n-2): n in [1..40]]; // Vincenzo Librandi, Oct 13 2015

CoefficientList[Series[(-1 + 4 x)/(-1 + 6 x + x^2), {x, 0, 33}], x] (* Vincenzo Librandi, Oct 13 2015 *)

Vec((-1+4*x)/(-1+6*x+x^2) + O(x^40)) \\ Colin Barker, Oct 13 2015

Let M = the 2x2 matrix [2,3; 3,4]. a(n) = term (1,1) in M^n.
G.f.: ( -1+4*x ) / ( -1+6*x+x^2 ). a(n) = A005668(n) + A015451(n). - R. J. Mathar, Jul 06 2012
a(n) = ((3-sqrt(10))^n*(1+sqrt(10))+(-1+sqrt(10))*(3+sqrt(10))^n)/(2*sqrt(10)). - Colin Barker, Oct 13 2015
a(n) = Sum_{k=0..n-2} A168561(n-2,k)*6^k + 2 * Sum_{k=0..n-1} A168561(n-1,k)*6^k, n>0. - R. J. Mathar, Feb 14 2024
a(n) = A005668(n+1) - 4*A005668(n). - R. J. Mathar, Feb 14 2024

Corrected by R. J. Mathar, Jul 06 2012

A078469 Number of different compositions of the ladder graph L_n.

Original entry on oeis.org

1, 2, 12, 74, 456, 2810, 17316, 106706, 657552, 4052018, 24969660, 153869978, 948189528, 5843007146, 36006232404, 221880401570, 1367288641824, 8425612252514, 51920962156908, 319951385193962, 1971629273320680

Offset: 0

Ralf Stephan, Jan 02 2003

This is equally the number of partitions of a 2 x n rectangle into connected pieces consisting of unit squares cut along lattice lines, like a 2-d analog of a partition into integers. - Hugo van der Sanden, Mar 23 2009

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Liam Buttitta, On the Number of Compositions of Km X Pn, Journal of Integer Sequences, Vol. 25 (2022), Article 22.4.1.
Tomislav Došlić and Luka Podrug, Sweet division problems: from chocolate bars to honeycomb strips and back, arXiv:2304.12121 [math.CO], 2023.
Tanya Khovanova, Recursive Sequences
A. Knopfmacher and M. E. Mays, Graph Compositions. I: Basic Enumeration, Integers 1(2001), #A04.
J. N. Ridley and M. E. Mays, Compositions of unions of graphs, Fib. Quart., 42 (2004), 222-230.
Index entries for linear recurrences with constant coefficients, signature (6,1).

Cf. A108808, A110476. - Brian Kell, Oct 21 2008

Cf. A152113, A152124.

I:=[1, 2, 12]; [n le 3 select I[n] else 6*Self(n-1)+Self(n-2): n in [1..30]]; // Vincenzo Librandi, May 17 2013

Join[{1},LinearRecurrence[{6,1},{2,12},30]] (* Harvey P. Dale, Jul 22 2013 *)

a(n) = 6*a(n-1) + a(n-2).
G.f.: 1 + 2*x/(1 - 6*x - x^2).
a(n) = ((3 + s)^n - (3 - s)^n)/s, where s = sqrt(10) (assumes a(0) = 0).
Asymptotic to (3 + sqrt(10))^n/sqrt(10). - Ralf Stephan, Jan 03 2003
Let p[i] = Fibonacci(3*i) and A be the Hessenberg matrix of order n defined by: A[i,j] = p[j-i+1], if i <= j; A[i,j] = -1, if i = j + 1; and A[i,j] = 0, otherwise. Then, for n >= 1, a(n) = det(A). - Milan Janjic, May 08 2010
a(n) = 2*A005668(n), n > 0. - R. J. Mathar, Nov 29 2015
a(n) >= A116694(2,n). - R. J. Mathar, Nov 29 2015

a(0) changed from 0 to 1 by N. J. A. Sloane, Sep 21 2009, at the suggestion of Hugo van der Sanden

A084070 a(n) = 38*a(n-1) - a(n-2), with a(0)=0, a(1)=6.

Original entry on oeis.org

0, 6, 228, 8658, 328776, 12484830, 474094764, 18003116202, 683644320912, 25960481078454, 985814636660340, 37434995712014466, 1421544022419889368, 53981237856243781518, 2049865494514843808316, 77840907553707820934490, 2955904621546382351702304

Offset: 0

Benoit Cloitre, May 10 2003

nonn

This sequence gives the values of y in solutions of the Diophantine equation x^2 - 10*y^2 = 1. The corresponding x values are in A078986. - Vincenzo Librandi, Aug 08 2010 [edited by Jon E. Schoenfield, May 04 2014]

			G.f. = 6*x + 228*x^2 + 8658*x^3 + 328776*x^4 + ... - _Michael Somos_, Feb 24 2023

Indranil Ghosh, Table of n, a(n) for n = 0..632
Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, Ellipse Chains and Associated Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
A. J. C. Cunningham, Binomial Factorisations, Vols. 1-9, Hodgson, London, 1923-1929. See Vol. 1, page xxxv.
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (38,-1).

Cf. A001078, A001109, A001353, A001653, A005668, A060645, A084068, A084069, A221874.

Cf. A078986. - Vincenzo Librandi, Apr 14 2010

a:=[0,6];; for n in [3..20] do a[n]:=38*a[n-1]-a[n-2]; od; a; # G. C. Greubel, Jan 12 2020

I:=[0,6]; [n le 2 select I[n] else 38*Self(n-1) - Self(n-2): n in [1..20]]; // G. C. Greubel, Jan 12 2020

seq( simplify(6*ChebyshevU(n-1, 19)), n=0..20); # G. C. Greubel, Jan 12 2020

LinearRecurrence[{38,-1},{0,6},30] (* Harvey P. Dale, Nov 01 2011 *)
6*ChebyshevU[Range[20]-2, 19] (* G. C. Greubel, Jan 12 2020 *)

u=0; v=6; for(n=2,20, w=38*v-u; u=v; v=w; print1(w,","))

vector(21, n, 6*polchebyshev(n-2, 2, 19) ) \\ G. C. Greubel, Jan 12 2020

[6*chebyshev_U(n-1, 19) for n in (0..20)] # G. C. Greubel, Jan 12 2020

Numbers k such that 10*k^2 = floor(k*sqrt(10)*ceiling(k*sqrt(10))).
From Mohamed Bouhamida, Sep 20 2006: (Start)
a(n) = 37*(a(n-1) + a(n-2)) - a(n-3).
a(n) = 39*(a(n-1) - a(n-2)) + a(n-3). (End)
From R. J. Mathar, Feb 19 2008: (Start)
O.g.f.: 6*x/(1 - 38*x + x^2).
a(n) = 6*A078987(n-1). (End)
a(n) = 6*ChebyshevU(n-1, 19). - G. C. Greubel, Jan 12 2020
a(n) = A005668(2*n). - Michael Somos, Feb 24 2023

cp's OEIS Frontend

A367298 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 4*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A243399 a(0) = 1, a(1) = 19; for n > 1, a(n) = 19*a(n-1) + a(n-2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Maxima

PARI

Sage

Formula

A140455 13-Fibonacci sequence.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A176398 Decimal expansion of 3+sqrt(10).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A154597 a(n) = 15*a(n-1) + a(n-2) with a(0) = 0, a(1) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A090018 a(n) = 6*a(n-1) + 3*a(n-2) for n > 2, a(0)=1, a(1)=6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A367298 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 4x, p(n,x) = up(n-1,x) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2x - x^2.

A090018 a(n) = 6a(n-1) + 3a(n-2) for n > 2, a(0)=1, a(1)=6.

A180032 Eight white queens and one red queen on a 3 X 3 chessboard. G.f.: (1+x)/(1-5x-7x^2).