A125905 -id:A125905 - cp's OEIS frontend

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

1, 2, 7, 26, 97, 362, 1351, 5042, 18817, 70226, 262087, 978122, 3650401, 13623482, 50843527, 189750626, 708158977, 2642885282, 9863382151, 36810643322, 137379191137, 512706121226, 1913445293767, 7141075053842, 26650854921601, 99462344632562, 371198523608647

Offset: 0

N. J. A. Sloane

Chebyshev's T(n,x) polynomials evaluated at x=2.
x = 2^n - 1 is prime if and only if x divides a(2^(n-2)).
Any k in the sequence is succeeded by 2*k + sqrt{3*(k^2 - 1)}. - Lekraj Beedassy, Jun 28 2002
For all elements x of the sequence, 12*x^2 - 12 is a square. Lim_{n -> infinity} a(n)/a(n-1) = 2 + sqrt(3) = (4 + sqrt(12))/2 which preserves the kinship with the equation "12*x^2 - 12 is a square" where the initial "12" ends up appearing as a square root. - Gregory V. Richardson, Oct 10 2002
This sequence gives the values of x in solutions of the Diophantine equation x^2 - 3*y^2 = 1; the corresponding values of y are in A001353. The solution ratios a(n)/A001353(n) are obtained as convergents of the continued fraction expansion of sqrt(3): either as successive convergents of [2;-4] or as odd convergents of [1;1,2]. - Lekraj Beedassy, Sep 19 2003 [edited by Jon E. Schoenfield, May 04 2014]
a(n) is half the central value in a list of three consecutive integers, the lengths of the sides of a triangle with integer sides and area. - Eugene McDonnell (eemcd(AT)mac.com), Oct 19 2003
a(3+6*k) - 1 and a(3+6*k) + 1 are consecutive odd powerful numbers. See A076445. - T. D. Noe, May 04 2006
The intermediate convergents to 3^(1/2), beginning with 3/2, 12/7, 45/26, 168/97, comprise a strictly increasing sequence; essentially, numerators=A005320, denominators=A001075. - Clark Kimberling, Aug 27 2008
The upper principal convergents to 3^(1/2), beginning with 2/1, 7/4, 26/15, 97/56, comprise a strictly decreasing sequence; numerators=A001075, denominators=A001353. - Clark Kimberling, Aug 27 2008
a(n+1) is the Hankel transform of A000108(n) + A000984(n) = (n+2)*Catalan(n). - Paul Barry, Aug 11 2009
Also, numbers such that floor(a(n)^2/3) is a square: base 3 analog of A031149, A204502, A204514, A204516, A204518, A204520, A004275, A001541. - M. F. Hasler, Jan 15 2012
Pisano period lengths:  1, 2, 2, 4, 3, 2, 8, 4, 6, 6, 10, 4, 12, 8, 6, 8, 18, 6, 5, 12, ... - R. J. Mathar, Aug 10 2012
Except for the first term, positive values of x (or y) satisfying x^2 - 4*x*y + y^2 + 3 = 0. - Colin Barker, Feb 04 2014
Except for the first term, positive values of x (or y) satisfying x^2 - 14*x*y + y^2 + 48 = 0. - Colin Barker, Feb 10 2014
From Gary W. Adamson, Jul 25 2016: (Start)
A triangle with row sums generating the sequence can be constructed by taking the production matrix M. Take powers of M, extracting the top rows.
M =
  1, 1, 0, 0, 0, 0, ...
  2, 0, 3, 0, 0, 0, ...
  2, 0, 0, 3, 0, 0, ...
  2, 0, 0, 0, 3, 0, ...
  2, 0, 0, 0, 0, 3, ...
  ...
The triangle generated from M is:
   1,
   1,  1,
   3,  1, 3,
  11,  3, 3, 9,
  41, 11, 9, 9, 27,
   ...
The left border is A001835 and row sums are (1, 2, 7, 26, 97, ...). (End)
Even-indexed terms are odd while odd-indexed terms are even. Indeed, a(2*n) = 2*(a(n))^2 - 1 and a(2*n+1) = 2*a(n)*a(n+1) - 2. - Timothy L. Tiffin, Oct 11 2016
For each n, a(0) divides a(n), a(1) divides a(2n+1), a(2) divides a(4*n+2), a(3) divides a(6*n+3), a(4) divides a(8*n+4), a(5) divides a(10n+5), and so on. Thus, a(k) divides a((2*n+1)*k) for each k > 0 and n >= 0. A proof of this can be found in Bhargava-Kedlaya-Ng's first solution to Problem A2 of the 76th Putnam Mathematical Competition. Links to the exam and its solutions can be found below. - Timothy L. Tiffin, Oct 12 2016
From Timothy L. Tiffin, Oct 21 2016: (Start)
If any term a(n) is a prime number, then its index n will be a power of 2. This is a consequence of the results given in the previous two comments. See A277434 for those prime terms.
a(2n) == 1 (mod 6) and a(2*n+1) == 2 (mod 6). Consequently, each odd prime factor of a(n) will be congruent to 1 modulo 6 and, thus, found in A002476.
a(n) == 1 (mod 10) if n == 0 (mod 6), a(n) == 2 (mod 10) if n == {1,-1} (mod 6), a(n) == 7 (mod 10) if n == {2,-2} (mod 6), and a(n) == 6 (mod 10) if n == 3 (mod 6). So, the rightmost digits of a(n) form a repeating cycle of length 6: 1, 2, 7, 6, 7, 2. (End)
a(A298211(n)) = A002350(3*n^2). - A.H.M. Smeets, Jan 25 2018
(2 + sqrt(3))^n = a(n) + A001353(n)*sqrt(3), n >= 0; integers in the quadratic number field Q(sqrt(3)). - Wolfdieter Lang, Feb 16 2018
Yong Hao Ng has shown that for any n, a(n) is coprime with any member of A001834 and with any member of A001835. - René Gy, Feb 26 2018
Positive numbers k such that 3*(k-1)*(k+1) is a square. - Davide Rotondo, Oct 25 2020
a(n)*a(n+1)-1 = a(2*n+1)/2 = A001570(n) divides both a(n)^6+1 and a(n+1)^6+1. In other words, for k = a(2*n+1)/2, (k+1)^6 has divisors congruent to -1 modulo k (cf. A350916). - Max Alekseyev, Jan 23 2022

			2^6 - 1 = 63 does not divide a(2^4) = 708158977, therefore 63 is composite. 2^5 - 1 = 31 divides a(2^3) = 18817, therefore 31 is prime.
G.f. = 1 + 2*x + 7*x^2 + 26*x^3 + 97*x^4 + 362*x^5 + 1351*x^6 + 5042*x^7 + ...

Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
Eugene McDonnell, "Heron's Rule and Integer-Area Triangles", Vector 12.3 (January 1996) pp. 133-142.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P.-F. Teilhet, Reply to Query 2094, L'Intermédiaire des Mathématiciens, 10 (1903), 235-238.

Indranil Ghosh, Table of n, a(n) for n = 0..1745 (terms 0..200 from T. D. Noe)
Christian Aebi and Grant Cairns, Lattice Equable Parallelograms, arXiv:2006.07566 [math.NT], 2020.
Christian Aebi and Grant Cairns, Less than Equable Triangles on the Eisenstein lattice, arXiv:2312.10866 [math.CO], 2023.
Krassimir T. Atanassov and Anthony G. Shannon, On intercalated Fibonacci sequences, Notes on Number Theory and Discrete Mathematics (2020) Vol. 26, No. 3, 218-223.
C. Banderier and D. Merlini, Lattice paths with an infinite set of jumps, FPSAC02, Melbourne, 2002.
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.
H. Brocard, Notes élémentaires sur le problème de Pell, Nouvelle Correspondance Mathématique, 4 (1878), 337-343.
Yurii S. Bystryk, Vitalii L. Denysenko, and Volodymyr I. Ostryk, Lune and Lens Sequences, ResearchGate preprint, 2024. See pp. 30, 43, 56.
Chris Caldwell, Primality Proving, Arndt's theorem.
J. B. Cosgrave and K. Dilcher, A role for generalized Fermat numbers, Math. Comp., 2016.
G. Dresden and Y. Li, Periodic Weighted Sums of Binomial Coefficients, arXiv:2210.04322 [math.NT], 2022.
E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart., 7 (1969), pp. 231-242.
Margherita Maria Ferrari and Norma Zagaglia Salvi, Aperiodic Compositions and Classical Integer Sequences, Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.8.
R. K. Guy, Letter to N. J. A. Sloane concerning A001075, A011943, A094347 [Scanned and annotated letter, included with permission]
Kiran S. Kedlaya, The 76th William Lowell Putnam Mathematical Competition, Dec 05 2015.
Kiran S. Kedlaya, Solutions to the 76th William Lowell Putnam Mathematical Competition, Dec 05 2015.
Tanya Khovanova, Recursive Sequences
Clark Kimberling, Best lower and upper approximates to irrational numbers, Elemente der Mathematik, 52 (1997) 122-126.
Pablo Lam-Estrada, Myriam Rosalía Maldonado-Ramírez, José Luis López-Bonilla, and Fausto Jarquín-Zárate, The sequences of Fibonacci and Lucas for each real quadratic fields Q(Sqrt(d)), arXiv:1904.13002 [math.NT], 2019.
Eugene McDonnell, Heron's Rule and Integer-Area Triangles, At Play With J, 2010.
Valcho Milchev and Tsvetelina Karamfilova, Domino tiling in grid - new dependence, arXiv:1707.09741 [math.HO], 2017.
Yong Hao Ng, A partition in three classes of the set of all prime numbers?, Mathematics Stack Exchange.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
F. V. Waugh and M. W. Maxfield, Side-and-diagonal numbers, Math. Mag., 40 (1967), 74-83.
Index entries for sequences related to Chebyshev polynomials.
Index entries for two-way infinite sequences
Index entries for linear recurrences with constant coefficients, signature (4,-1).

Bisections are A011943 and A094347.

Cf. A001353, A065918, A071954, A001571, A001834, A003500, A016064, A082840, A026150, A277434.

a001075 n = a001075_list !! n
a001075_list =
   1 : 2 : zipWith (-) (map (4 *) $ tail a001075_list) a001075_list
-- Reinhard Zumkeller, Aug 11 2011

I:=[1, 2]; [n le 2 select I[n] else 4*Self(n-1) - Self(n-2): n in [1..30]]; // G. C. Greubel, Dec 19 2017

A001075 := proc(n)
    orthopoly[T](n,2) ;
end proc:
seq(A001075(n),n=0..30) ; # R. J. Mathar, Apr 14 2018

Table[ Ceiling[(1/2)*(2 + Sqrt[3])^n], {n, 0, 24}]
CoefficientList[Series[(1-2*x) / (1-4*x+x^2), {x, 0, 24}], x] (* Jean-François Alcover, Dec 21 2011, after Simon Plouffe *)
LinearRecurrence[{4,-1},{1,2},30] (* Harvey P. Dale, Aug 22 2015 *)
Round@Table[LucasL[2n, Sqrt[2]]/2, {n, 0, 20}] (* Vladimir Reshetnikov, Sep 15 2016 *)
ChebyshevT[Range[0, 20], 2] (* Eric W. Weisstein, May 26 2017 *)
a[ n_] := LucasL[2*n, x]/2 /. x->Sqrt[2]; (* Michael Somos, Sep 05 2022 *)

{a(n) = subst(poltchebi(abs(n)), x, 2)};

{a(n) = real((2 + quadgen(12))^abs(n))};

{a(n) = polsym(1 - 4*x + x^2, abs(n))[1 + abs(n)]/2};

a(n)=polchebyshev(n,1,2) \\ Charles R Greathouse IV, Nov 07 2016

my(x='x+O('x^30)); Vec((1-2*x)/(1-4*x+x^2)) \\ G. C. Greubel, Dec 19 2017

[lucas_number2(n,4,1)/2 for n in range(0, 25)] # Zerinvary Lajos, May 14 2009

def a(n):
    Q = QuadraticField(3, 't')
    u = Q.units()[0]
    return (u^n).lift().coeffs()[0]  # Ralf Stephan, Jun 19 2014

G.f.: (1 - 2*x)/(1 - 4*x + x^2). - Simon Plouffe in his 1992 dissertation
E.g.f.: exp(2*x)*cosh(sqrt(3)*x).
a(n) = 4*a(n-1) - a(n-2) = a(-n).
a(n) = (S(n, 4) - S(n-2, 4))/2 = T(n, 2), with S(n, x) := U(n, x/2), S(-1, x) := 0, S(-2, x) := -1. U, resp. T, are Chebyshev's polynomials of the second, resp. first, kind. S(n-1, 4) = A001353(n), n >= 0. See A049310 and A053120.
a(n) = A001353(n+2) - 2*A001353(n+1).
a(n) = sqrt(1 + 3*A001353(n)) (cf. Richardson comment, Oct 10 2002).
a(n) = 2^(-n)*Sum_{k>=0} binomial(2*n, 2*k)*3^k = 2^(-n)*Sum_{k>=0} A086645(n, k)*3^k. - Philippe Deléham, Mar 01 2004
a(n) = ((2 + sqrt(3))^n + (2 - sqrt(3))^n)/2; a(n) = ceiling((1/2)*(2 + sqrt(3))^(n)).
a(n) = cosh(n * log(2 + sqrt(3))).
a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2*k)*2^(n-2*k)*3^k. - Paul Barry, May 08 2003
a(n+2) = 2*a(n+1) + 3*Sum_{k>=0} a(n-k)*2^k. - Philippe Deléham, Mar 03 2004
a(n) = 2*a(n-1) + 3*A001353(n-1). - Lekraj Beedassy, Jul 21 2006
a(n) = left term of M^n * [1,0] where M = the 2 X 2 matrix [2,3; 1,2]. Right term = A001353(n). Example: a(4) = 97 since M^4 * [1,0] = [A001075(4), A001353(4)] = [97, 56]. - Gary W. Adamson, Dec 27 2006
Binomial transform of A026150: (1, 1, 4, 10, 28, 76, ...). - Gary W. Adamson, Nov 23 2007
First differences of A001571. - N. J. A. Sloane, Nov 03 2009
Sequence satisfies -3 = f(a(n), a(n+1)) where f(u, v) = u^2 + v^2 - 4*u*v. - Michael Somos, Sep 19 2008
a(n) = Sum_{k=0..n} A201730(n,k)*2^k. - Philippe Deléham, Dec 06 2011
G.f.: G(0)/2, where G(k) = 1 + 1/(1 - x*(3*k - 4)/(x*(3*k - 1) - 2/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 28 2013
a(n) = Sum_{k=0..n} A238731(n,k). - Philippe Deléham, Mar 05 2014
a(n) = (-1)^n*(A125905(n) + 2*A125905(n-1)), n > 0. - Franck Maminirina Ramaharo, Nov 11 2018
a(n) = (tan(Pi/12)^n + tan(5*Pi/12)^n)/2. - Greg Dresden, Oct 01 2020
From Peter Bala, Aug 17 2022: (Start)
a(n) = (1/2)^n * [x^n] ( 4*x + sqrt(1 + 12*x^2) )^n.
The g.f. A(x) satisfies A(2*x) = 1 + x*B'(x)/B(x), where B(x) = 1/sqrt(1 - 8*x + 4*x^2) is the g.f. of A069835.
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p >= 3 and positive integers n and k.
Sum_{n >= 1} 1/(a(n) - (3/2)/a(n)) = 1.
Sum_{n >= 1} (-1)^(n+1)/(a(n) + (1/2)/a(n)) = 1/3.
Sum_{n >= 1} 1/(a(n)^2 - 3/2) = 1 - 1/sqrt(3). (End)
a(n) = binomial(2*n, n) + 2*Sum_{k > 0} binomial(2*n, n+2*k)*cos(k*Pi/3). - Greg Dresden, Oct 11 2022
2*a(n) + 2^n = 3*Sum_{k=-n..n} (-1)^k*binomial(2*n, n+6*k). - Greg Dresden, Feb 07 2023

More terms from James Sellers, Jul 10 2000

Chebyshev comments from Wolfdieter Lang, Oct 31 2002

A001835 a(n) = 4*a(n-1) - a(n-2), with a(0) = 1, a(1) = 1.

Original entry on oeis.org

1, 1, 3, 11, 41, 153, 571, 2131, 7953, 29681, 110771, 413403, 1542841, 5757961, 21489003, 80198051, 299303201, 1117014753, 4168755811, 15558008491, 58063278153, 216695104121, 808717138331, 3018173449203, 11263976658481, 42037733184721, 156886956080403, 585510091136891

Offset: 0

N. J. A. Sloane

See A079935 for another version.
Number of ways of packing a 3 X 2*(n-1) rectangle with dominoes. - David Singmaster.
Equivalently, number of perfect matchings of the P_3 X P_{2(n-1)} lattice graph. - Emeric Deutsch, Dec 28 2004
The terms of this sequence are the positive square roots of the indices of the octagonal numbers (A046184) - Nicholas S. Horne (nairon(AT)loa.com), Dec 13 1999
Terms are the solutions to: 3*x^2 - 2 is a square. - Benoit Cloitre, Apr 07 2002
Gives solutions x > 0 of the equation floor(x*r*floor(x/r)) == floor(x/r*floor(x*r)) where r = 1 + sqrt(3). - Benoit Cloitre, Feb 19 2004
a(n) = L(n-1,4), where L is defined as in A108299; see also A001834 for L(n,-4). - Reinhard Zumkeller, Jun 01 2005
Values x + y, where (x, y) solves for x^2 - 3*y^2 = 1, i.e., a(n) = A001075(n) + A001353(n). - Lekraj Beedassy, Jul 21 2006
Number of 01-avoiding words of length n on alphabet {0,1,2,3} which do not end in 0. (E.g., for n = 2 we have 02, 03, 11, 12, 13, 21, 22, 23, 31, 32, 33.) - Tanya Khovanova, Jan 10 2007
sqrt(3) = 2/2 + 2/3 + 2/(3*11) + 2/(11*41) + 2/(41*153) + 2/(153*571) + ... - Gary W. Adamson, Dec 18 2007
The lower principal convergents to 3^(1/2), beginning with 1/1, 5/3, 19/11, 71/41, comprise a strictly increasing sequence; numerators = A001834, denominators = A001835. - Clark Kimberling, Aug 27 2008
From Gary W. Adamson, Jun 21 2009: (Start)
A001835 and A001353 = bisection of denominators of continued fraction [1, 2, 1, 2, 1, 2, ...]; i.e., bisection of A002530.
a(n) = determinant of an n*n tridiagonal matrix with 1's in the super- and subdiagonals and (3, 4, 4, 4, ...) as the main diagonal.
Also, the product of the eigenvalues of such matrices: a(n) = Product_{k=1..(n-1)/2)} (4 + 2*cos(2*k*Pi/n).
(End)
Let M = a triangle with the even-indexed Fibonacci numbers (1, 3, 8, 21, ...) in every column, and the leftmost column shifted up one row. a(n) starting (1, 3, 11, ...) = lim_{n->oo} M^n, the left-shifted vector considered as a sequence. - Gary W. Adamson, Jul 27 2010
a(n+1) is the number of compositions of n when there are 3 types of 1 and 2 types of other natural numbers. - Milan Janjic, Aug 13 2010
For n >= 2, a(n) equals the permanent of the (2*n-2) X (2*n-2) tridiagonal matrix with sqrt(2)'s along the main diagonal, and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
Primes in the sequence are apparently those in A096147. - R. J. Mathar, May 09 2013
Except for the first term, positive values of x (or y) satisfying x^2 - 4xy + y^2 + 2 = 0. - Colin Barker, Feb 04 2014
Except for the first term, positive values of x (or y) satisfying x^2 - 14xy + y^2 + 32 = 0. - Colin Barker, Feb 10 2014
The (1,1) element of A^n where A = (1, 1, 1; 1, 2, 1; 1, 1, 2). - David Neil McGrath, Jul 23 2014
Yong Hao Ng has shown that for any n, a(n) is coprime with any member of A001834 and with any member of A001075. - René Gy, Feb 25 2018
a(n+1) is the number of spanning trees of the graph T_n, where T_n is a 2 X n grid with an additional vertex v adjacent to (1,1) and (2,1). - Kevin Long, May 04 2018
a(n)/A001353(n) is the resistance of an n-ladder graph whose edges are replaced by one-ohm resistors. The resistance in ohms is measured at two nodes at one end of the ladder. It approaches sqrt(3) - 1 for n -> oo. See A342568, A357113, and A357115 for related information. - Hugo Pfoertner, Sep 17 2022
a(n) is the number of ways to tile a 1 X (n-1) strip with three types of tiles: small isosceles right triangles (with small side length 1), 1 X 1 squares formed by joining two of those right triangles along the hypotenuse, and large isosceles right triangles (with large side length 2) formed by joining two of those right triangles along a short leg. As an example, here is one of the a(6)=571 ways to tile a 1 X 5 strip with these kinds of tiles:
   ____________
  | / \ |\   /|  |
  |/_\|\/_||. - Greg Dresden and Arjun Datta, Jun 30 2023
From Klaus Purath, May 11 2024: (Start)
For any two consecutive terms (a(n), a(n+1)) = (x,y): x^2 - 4xy + y^2 = -2 = A028872(-1). In general, the following applies to all sequences (t) satisfying t(i) = 4t(i-1) - t(i-2) with t(0) = 1 and two consecutive terms (x,y): x^2 - 4xy + y^2 = A028872(t(1)-2). This includes and interprets the Feb 04 2014 comments here and on A001075 by Colin Barker and the Dec 12 2012 comment on A001353 by Max Alekseyev. By analogy to this, for three consecutive terms (x,y,z) y^2 - xz = A028872(t(1)-2). This includes and interprets the Jul 10 2021 comment on A001353 by Bernd Mulansky.
If (t) is a sequence satisfying t(k) = 3t(k-1) + 3t(k-2) - t(k-3) or t(k) = 4t(k-1) - t(k-2) without regard to initial values and including this sequence itself, then a(n) = (t(k+2n+1) + t(k))/(t(k+n+1) + t(k+n)) always applies, as long as t(k+n+1) + t(k+n) != 0 for integer k and n >= 1. (End)
Binomial transform of 1, 0, 2, 4, 12, ... (A028860 without the initial -1) and reverse binomial transform of 1, 2, 6, 24, 108, ... (A094433 without the initial 1). - Klaus Purath, Sep 09 2024

Julio R. Bastida, Quadratic properties of a linearly recurrent sequence. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 163-166, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561042 (81e:10009).
Leonhard Euler, (E388) Vollstaendige Anleitung zur Algebra, Zweiter Theil, reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 1, p. 375.
F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Ars Combin. 49 (1998), 129-154.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 329.
Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics I, p. 292.

T. D. Noe, Table of n, a(n) for n = 0..200
Mudit Aggarwal and Samrith Ram, Generating functions for straight polyomino tilings of narrow rectangles, arXiv:2206.04437 [math.CO], 2022.
R. C. Alperin, A family of nonlinear recurrences and their linear solutions, Fib. Q., 57:4 (2019), 318-321.
Krassimir T. Atanassov and Anthony G. Shannon, On intercalated Fibonacci sequences, Notes on Number Theory and Discrete Mathematics (2020) Vol. 26, No. 3, 218-223.
Steve Butler, Paul Horn, and Eric Tressler, Intersecting Domino Tilings, Fibonacci Quart. 48 (2010), no. 2, 114-120.
Yurii S. Bystryk, Vitalii L. Denysenko, and Volodymyr I. Ostryk, Lune and Lens Sequences, ResearchGate preprint, 2024. See pp. 31, 56.
Niccolò Castronuovo, On the number of fixed points of the map gamma, arXiv:2102.02739 [math.NT], 2021. Mentions this sequence.
A. Consilvio et al., Tilings, ordered partitions, and weird languages, MAA FOCUS, June/July 2012, 16-17.
J. B. Cosgrave and K. Dilcher, A role for generalized Fermat numbers, Math. Comp., to appear 2016; (See paper #10).
J. B. Cosgrave and K. Dilcher, A role for generalized Fermat numbers, Math. Comp. 86 (2017), 899-933.
Leonhard Euler, Vollstaendige Anleitung zur Algebra, Zweiter Teil.
F. Faase, On the number of specific spanning subgraphs of the graphs G X P_n, Preliminary version of paper that appeared in Ars Combin. 49 (1998), 129-154.
F. Faase, Counting Hamiltonian cycles in product graphs.
F. Faase, Results from the counting program.
Alex Fink, Richard K. Guy, and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114. See Section 13.
Darren B. Glass, Critical groups of graphs with dihedral actions. II, Eur. J. Comb. 61, 25-46 (2017).
H. Hosoya and A. Motoyama, An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices, J. Math. Physics 26 (1985) 157-167 (Table V).
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 409.
Tanya Khovanova, Recursive Sequences,
Clark Kimberling, Best lower and upper approximates to irrational numbers, Elemente der Mathematik, 52 (1997) 122-126.
David Klarner and Jordan Pollack, Domino tilings of rectangles with fixed width, Disc. Math. 32 (1980) 45-52.
R. J. Mathar, Paving Rectangular Regions with Rectangular Tiles: Tatami and Non-Tatami Tilings, arXiv:1311.6135 [math.CO], 2013, Table 2.
R. J. Mathar, Tilings of rectangular regions by rectangular tiles: Counts derived from transfer matrices, arXiv:1406.7788 (2014), eq. (4).
Valcho Milchev and Tsvetelina Karamfilova, Domino tiling in grid - new dependence, arXiv:1707.09741 [math.HO], 2017.
Yong Hao Ng, A partition in three classes of the set of all prime numbers?, Math StackExchange.
J.-C. Novelli and J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Jaime Rangel-Mondragon, Polyominoes and Related Families, The Mathematica Journal, 9:3 (2005), 609-640.
John Riordan, Letter to N. J. A. Sloane, Sep 26 1980 with notes on the 1973 Handbook of Integer Sequences. Note that the sequences are identified by their N-numbers, not their A-numbers.
David Singmaster, Letter to N. J. A. Sloane, Oct 3 1982.
Anitha Srinivasan, The Markoff-Fibonacci Numbers, Fibonacci Quart. 58 (2020), no. 5, 222-228.
Thotsaporn "Aek" Thanatipanonda, Statistics of Domino Tilings on a Rectangular Board, Fibonacci Quart. 57 (2019), no. 5, 145-153. See p. 151.
Herman Tulleken, Polyominoes 2.2: How they fit together, (2019).
F. V. Waugh and M. W. Maxfield, Side-and-diagonal numbers, Math. Mag., 40 (1967), 74-83.
Index entries for sequences related to dominoes.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (4,-1).

Row 3 of array A099390.
Essentially the same as A079935.
First differences of A001353.
Partial sums of A052530.
Pairwise sums of A006253.
Bisection of A002530, A005246 and A048788.
First column of array A103997.
Cf. A001519, A003699, A082841, A101265, A125077, A001353, A001542, A096147 (subsequence of primes).

a:=[1,1];; for n in [3..20] do a[n]:=4*a[n-1]-a[n-2]; od; a; # G. C. Greubel, Dec 23 2019

a001835 n = a001835_list !! n
a001835_list =
   1 : 1 : zipWith (-) (map (4 *) $ tail a001835_list) a001835_list
-- Reinhard Zumkeller, Aug 14 2011

[n le 2 select 1 else 4*Self(n-1)-Self(n-2): n in [1..25]]; // Vincenzo Librandi, Sep 16 2016

f:=n->((3+sqrt(3))^(2*n-1)+(3-sqrt(3))^(2*n-1))/6^n; [seq(simplify(expand(f(n))),n=0..20)]; # N. J. A. Sloane, Nov 10 2009

CoefficientList[Series[(1-3x)/(1-4x+x^2), {x, 0, 24}], x] (* Jean-François Alcover, Jul 25 2011, after g.f. *)
LinearRecurrence[{4,-1},{1,1},30] (* Harvey P. Dale, Jun 08 2013 *)
Table[Round@Fibonacci[2n-1, Sqrt[2]], {n, 0, 20}] (* Vladimir Reshetnikov, Sep 15 2016 *)
Table[(3*ChebyshevT[n, 2] - ChebyshevU[n, 2])/2, {n, 0, 20}] (* G. C. Greubel, Dec 23 2019 *)

{a(n) = real( (2 + quadgen(12))^n * (1 - 1 / quadgen(12)) )} /* Michael Somos, Sep 19 2008 */

{a(n) = subst( (polchebyshev(n) + polchebyshev(n-1)) / 3, x, 2)} /* Michael Somos, Sep 19 2008 */

[lucas_number1(n,4,1)-lucas_number1(n-1,4,1) for n in range(25)] # Zerinvary Lajos, Apr 29 2009

[(3*chebyshev_T(n,2) - chebyshev_U(n,2))/2 for n in (0..20)] # G. C. Greubel, Dec 23 2019

G.f.: (1 - 3*x)/(1 - 4*x + x^2). - Simon Plouffe in his 1992 dissertation
a(1-n) = a(n).
a(n) = ((3 + sqrt(3))^(2*n - 1) + (3 - sqrt(3))^(2*n - 1))/6^n. - Dean Hickerson, Dec 01 2002
a(n) = (8 + a(n-1)*a(n-2))/a(n-3). - Michael Somos, Aug 01 2001
a(n+1) = Sum_{k=0..n} 2^k * binomial(n + k, n - k), n >= 0. - Len Smiley, Dec 09 2001
Limit_{n->oo} a(n)/a(n-1) = 2 + sqrt(3). - Gregory V. Richardson, Oct 10 2002
a(n) = 2*A061278(n-1) + 1 for n > 0. - Bruce Corrigan (scentman(AT)myfamily.com), Nov 04 2002
Let q(n, x) = Sum_{i=0..n} x^(n-i)*binomial(2*n - i, i); then q(n, 2) = a(n+1). - Benoit Cloitre, Nov 10 2002
a(n+1) = Sum_{k=0..n} ((-1)^k)*((2*n+1)/(2*n + 1 - k))*binomial(2*n + 1 - k, k)*6^(n - k) (from standard T(n,x)/x, n >= 1, Chebyshev sum formula). The Smiley and Cloitre sum representation is that of the S(2*n, i*sqrt(2))*(-1)^n Chebyshev polynomial. - Wolfdieter Lang, Nov 29 2002
a(n) = S(n-1, 4) - S(n-2, 4) = T(2*n-1, sqrt(3/2))/sqrt(3/2) = S(2*(n-1), i*sqrt(2))*(-1)^(n - 1), with S(n, x) := U(n, x/2), resp. T(n, x), Chebyshev's polynomials of the second, resp. first, kind. See A049310 and A053120. S(-1, x) = 0, S(-2, x) = -1, S(n, 4) = A001353(n+1), T(-1, x) = x.
a(n+1) = sqrt((A001834(n)^2 + 2)/3), n >= 0 (see Cloitre comment).
Sequence satisfies -2 = f(a(n), a(n+1)) where f(u, v) = u^2 + v^2 - 4*u*v. - Michael Somos, Sep 19 2008
a(n) = (1/6)*(3*(2 - sqrt(3))^n + sqrt(3)*(2 - sqrt(3))^n + 3*(2 + sqrt(3))^n - sqrt(3)*(2 + sqrt(3))^n) (Mathematica's solution to the recurrence relation). - Sarah-Marie Belcastro, Jul 04 2009
If p[1] = 3, p[i] = 2, (i > 1), and if A is Hessenberg matrix of order n defined by: A[i,j] = p[j-i+1], (i <= j), A[i,j] = -1, (i = j+1), and A[i,j] = 0 otherwise. Then, for n >= 1, a(n+1) = det A. - Milan Janjic, Apr 29 2010
a(n) = (a(n-1)^2 + 2)/a(n-2). - Irene Sermon, Oct 28 2013
a(n) = A001353(n+1) - 3*A001353(n). - R. J. Mathar, Oct 30 2015
a(n) = a(n-1) + 2*A001353(n-1). - Kevin Long, May 04 2018
From Franck Maminirina Ramaharo, Nov 11 2018: (Start)
a(n) = (-1)^n*(A125905(n) + 3*A125905(n-1)), n > 0.
E.g.f.: exp^(2*x)*(3*cosh(sqrt(3)*x) - sqrt(3)*sinh(sqrt(3)*x))/3. (End)
From Peter Bala, Feb 12 2024: (Start)
For n in Z, a(n) = A001353(n) + A001353(1-n).
For n, j, k in Z, a(n)*a(n+j+k) - a(n+j)*a(n+k) = 2*A001353(j)*A001353(k). The case j = 1, k = 2 is given above. (End)

A001834 a(0) = 1, a(1) = 5, a(n) = 4*a(n-1) - a(n-2).

Original entry on oeis.org

1, 5, 19, 71, 265, 989, 3691, 13775, 51409, 191861, 716035, 2672279, 9973081, 37220045, 138907099, 518408351, 1934726305, 7220496869, 26947261171, 100568547815, 375326930089, 1400739172541, 5227629760075, 19509779867759, 72811489710961, 271736178976085

Offset: 0

N. J. A. Sloane

Sequence also gives values of x satisfying 3*y^2 - x^2 = 2, the corresponding y being given by A001835(n+1). Moreover, quadruples(p, q, r, s) satisfying p^2 + q^2 + r^2 = s^2, where p = q and r is either p+1 or p-1, are termed nearly isosceles Pythagorean and are given by p = {x + (-1)^n}/3, r = p-(-1)^n, s = y for n > 1. - Lekraj Beedassy, Jul 19 2002
a(n)= A002531(1+2*n). - Anton Vrba (antonvrba(AT)yahoo.com), Feb 14 2007
361 written in base A001835(n+1) - 1 is the square of a(n). E.g., a(12) = 2672279, A001835(13) - 1 = 1542840. We have 361_(1542840) = 3*1542840 + 6*1542840 + 1 = 2672279^2. - Richard Choulet, Oct 04 2007
The lower principal convergents to 3^(1/2), beginning with 1/1, 5/3, 19/11, 71/41, comprise a strictly increasing sequence; numerators=A001834, denominators=A001835. - Clark Kimberling, Aug 27 2008
General recurrence is a(n) = (a(1) - 1)*a(n-1) - a(n-2), a(1) >= 4, lim_{n->infinity} a(n) = x*(k*x + 1)^n, k = (a(1) - 3), x = (1 + sqrt((a(1) + 1)/(a(1) - 3)))/2. Examples in OEIS: a(1) = 4 gives A002878, primes in it A121534. a(1) = 5 gives A001834, primes in it A086386. a(1) = 6 gives A030221, primes in it A299109. a(1) = 7 gives A002315, primes in it A088165. a(1) = 8 gives A033890, primes in it not in OEIS (do there exist any?). a(1) = 9 gives A057080, primes in {71, 34649, 16908641, ...}. a(1) = 10 gives A057081, primes in it {389806471, 192097408520951, ...}. - Ctibor O. Zizka, Sep 02 2008
Inverse binomial transform of A030192. - Philippe Deléham, Nov 19 2009
For positive n, a(n) equals the permanent of the (2*n) X (2*n) tridiagonal matrix with sqrt(6)'s along the main diagonal, and i's along the superdiagonal and the subdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
x-values in the solution to 3x^2 + 6 = y^2 (see A082841 for the y-values). - Sture Sjöstedt, Nov 25 2011
Pisano period lengths: 1, 1, 2, 4, 3, 2, 8, 4, 6, 3, 10, 4, 12, 8, 6, 8, 18, 6, 5, 12, ... - R. J. Mathar, Aug 10 2012
The aerated sequence (b(n))A100047%20for%20a%20connection%20with%20Chebyshev%20polynomials.%20-%20_Peter%20Bala">{n>=1} = [1, 0, 5, 0, 19, 0, 71, 0, ...] is a fourth-order linear divisibility sequence; that is, if n | m then b(n) | b(m). It is the case P1 = 0, P2 = -2, Q = -1 of the 3-parameter family of divisibility sequences found by Williams and Guy. See A100047 for a connection with Chebyshev polynomials. - _Peter Bala, Mar 22 2015
Yong Hao Ng has shown that for any n, a(n) is coprime with any member of A001835 and with any member of A001075. - René Gy, Feb 26 2018
From Wolfdieter Lang, Oct 15 2020: (Start)
((-1)^n)*a(n) = X(n) = (-1)^n*(S(n, 4) + S(n-1, 4)) and Y(n) = X(n-1) gives all integer solutions (modulo sign flip between X and Y) of X^2 + Y^2 + 4*X*Y = +6, for n = -oo..+oo, with Chebyshev S polynomials (see A049310), with S(-1, x) = 0, and S(-|n|, x) = - S(|n|-2, x), for |n| >= 2.
This binary indefinite quadratic form of discriminant 12, representing 6, has only this family of proper solutions (modulo sign flip), and no improper ones.
This comment is inspired by a paper by Robert K. Moniot (private communication). See his Oct 04 2020 comment in A027941 related to the case of x^2 + y^2 - 3*x*y = -1 (special Markov solutions). (End)
Floretion Algebra Multiplication Program, FAMP Code: A001834 = (4/3)vesseq[ - .25'i + 1.25'j - .25'k - .25i' + 1.25j' - .25k' + 1.25'ii' + .25'jj' - .75'kk' + .75'ij' + .25'ik' + .75'ji' - .25'jk' + .25'ki' - .25'kj' + .25e], apart from initial term

			G.f. = 1 + 5*x + 19*x^2 + 71*x^3 + 265*x^4 + 989*x^5 + 3691*x^6 + ...

Bastida, Julio R. Quadratic properties of a linearly recurrent sequence. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 163--166, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561042 (81e:10009)
Leonhard Euler, (E388) Vollstaendige Anleitung zur Algebra, Zweiter Theil, reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 1, p. 375.
Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P.-F. Teilhet, Reply to Query 2094, L'Intermédiaire des Mathématiciens, 10 (1903), 235-238.

T. D. Noe, Table of n, a(n) for n=0..200
Marco Abrate, Stefano Barbero, Umberto Cerruti, and Nadir Murru, Polynomial sequences on quadratic curves, Integers, Vol. 15, 2015, #A38.
K. Andersen, L. Carbone, and D. Penta, Kac-Moody Fibonacci sequences, hyperbolic golden ratios, and real quadratic fields, Journal of Number Theory and Combinatorics, Vol 2, No. 3 pp 245-278, 2011. See Section 9.
J. B. Cosgrave and K. Dilcher, A role for generalized Fermat numbers, Math. Comp. 86 (2017), 899-933; see also Paper #10.
Bruno Deschamps, Sur les bonnes valeurs initiales de la suite de Lucas-Lehmer, Journal of Number Theory, Volume 130, Issue 12, December 2010, Pages 2658-2670.
Leonhard Euler, Vollstaendige Anleitung zur Algebra, Zweiter Teil.
Alex Fink, Richard K. Guy, and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114. See Section 13.
Taras Goy and Mark Shattuck, Determinants of Toeplitz-Hessenberg Matrices with Generalized Leonardo Number Entries, Ann. Math. Silesianae (2023). See p. 17.
Christian Kassel and Christophe Reutenauer, Pairs of intertwined integer sequences, arXiv:2507.15780 [math.NT], 2025. See p. 13.
Tanya Khovanova, Recursive Sequences
Seong Ju Kim, R. Stees, and L. Taalman, Sequences of Spiral Knot Determinants, Journal of Integer Sequences, Vol. 19 (2016), # 16.1.4
Clark Kimberling, Best lower and upper approximates to irrational numbers, Elemente der Mathematik, 52 (1997) 122-126.
Wolfdieter Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eq. (44) rhs, m=6.
Ioana-Claudia Lazăr, Lucas sequences in t-uniform simplicial complexes, arXiv:1904.06555 [math.GR], 2019.
Donatella Merlini and Renzo Sprugnoli, Arithmetic into geometric progressions through Riordan arrays, Discrete Mathematics 340.2 (2017): 160-174.
Yong Hao Ng, A partition in three classes of the set of all prime numbers?, Math StackExchange.
S. Northshield, An Analogue of Stern's Sequence for Z[sqrt(2)], Journal of Integer Sequences, 18 (2015), #15.11.6.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions and Conjectures, Universite du Quebec a Montreal, 1992.
Ryan Stees, Sequences of Spiral Knot Determinants, Senior Honors Projects, Paper 84, James Madison Univ., May 2016.
F. V. Waugh and M. W. Maxfield, Side-and-diagonal numbers, Math. Mag., 40 (1967), 74-83.
H. C. Williams and R. K. Guy, Some fourth-order linear divisibility sequences, Intl. J. Number Theory 7 (5) (2011) 1255-1277.
H. C. Williams and R. K. Guy, Some Monoapparitic Fourth Order Linear Divisibility Sequences, Integers, Volume 12A (2012) The John Selfridge Memorial Volume.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (4,-1).

A bisection of sequence A002531.
Cf. A001352, A001835, A086386 (prime members).
Cf. A026150.
Cf. A082841, A100047.
Cf. A002531, A001353, A049310.
a(n)^2+1 = A094347(n+1).

a001834 n = a001834_list !! (n-1)
a001834_list = 1 : 5 : zipWith (-) (map (* 4) $ tail a001834_list) a001834_list
-- Reinhard Zumkeller, Jan 23 2012

I:=[1,5]; [n le 2 select I[n] else 4*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Mar 22 2015

f:=n->((1+sqrt(3))^(2*n+1)+(1-sqrt(3))^(2*n+1))/2^(n+1); # N. J. A. Sloane, Nov 10 2009

a[0] = 1; a[1] = 5; a[n_] := a[n] = 4a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 25}] (* Robert G. Wilson v, Apr 24 2004 *)
Table[Expand[((1+Sqrt[3])^(2*n+1)+(1+Sqrt[3])^(2*n+1))/2^(n+1)],{n, 0, 20}] (* Anton Vrba, Feb 14 2007 *)
LinearRecurrence[{4, -1}, {1, 5}, 50] (* Sture Sjöstedt, Nov 27 2011 *)
a[c_, n_] := Module[{},
   p := Length[ContinuedFraction[ Sqrt[ c]][[2]]];
   d := Numerator[Convergents[Sqrt[c], n p]];
   t := Table[d[[1 + i]], {i, 0, Length[d] - 1, p}];
   Return[t];
] (* Complement of A002531 *)
a[3, 20] (* Gerry Martens, Jun 07 2015 *)
Round@Table[LucasL[2n+1, Sqrt[2]]/Sqrt[2], {n, 0, 20}] (* Vladimir Reshetnikov, Sep 15 2016 *)

{a(n) = real( (2 + quadgen(12))^n * (1 + quadgen(12)) )}; /* Michael Somos, Sep 19 2008 */

{a(n) = subst( polchebyshev(n-1, 2) + polchebyshev(n, 2), x, 2)}; /* Michael Somos, Sep 19 2008 */

[(lucas_number2(n,4,1)-lucas_number2(n-1,4,1))/2 for n in range(1, 27)] # Zerinvary Lajos, Nov 10 2009

a(n) = ((1 + sqrt(3))^(2*n + 1) + (1 - sqrt(3))^(2*n + 1))/2^(n + 1). - N. J. A. Sloane, Nov 10 2009
a(n) = (1/2) * ((1 + sqrt(3))*(2 + sqrt(3))^n + (1 - sqrt(3))*(2 - sqrt(3))^n). - Dean Hickerson, Dec 01 2002
From Mario Catalani, Apr 11 2003: (Start)
With a = 2 + sqrt(3), b = 2 - sqrt(3): a(n) = (1/sqrt(2))(a^(n + 1/2) - b^(n + 1/2)).
a(n) - a(n-1) = A003500(n).
a(n) = sqrt(1 + 12*A061278(n) + 12*A061278(n)^2). (End)
a(n) = ((1 + sqrt(3))^(2*n + 1) + (1 - sqrt(3))^(2*n + 1))/2^(n + 1). - Anton Vrba, Feb 14 2007
G.f.: (1 + x)/((1 - 4*x + x^2)). Simon Plouffe in his 1992 dissertation.
a(n) = S(2*n, sqrt(6)) = S(n, 4) + S(n-1, 4); S(n, x) := U(n, x/2), Chebyshev polynomials of 2nd kind, A049310. S(n, 4) = A001353(n).
For all members x of the sequence, 3*x^2 + 6 is a square. Limit_{n->infinity} a(n)/a(n-1) = 2 + sqrt(3). - Gregory V. Richardson, Oct 10 2002
a(n) = 2*A001571(n) + 1. - Bruce Corrigan (scentman(AT)myfamily.com), Nov 04 2002
Let q(n, x) = Sum_{i=0..n} x^(n - i)*binomial(2*n - i, i); then (-1)^n*q(n, -6) = a(n). - Benoit Cloitre, Nov 10 2002
a(n) = 2^(-n)*Sum_{k>=0} binomial(2*n + 1, 2*k)*3^k; see A091042. - Philippe Deléham, Mar 01 2004
a(n) = floor(sqrt(3)*A001835(n+1)). - Philippe Deléham, Mar 03 2004
a(n+1) - 2*a(n) = 3*A001835(n+1). Using the known relation A001835(n+1) = sqrt((a(n)^2 + 2)/3) it follows that a(n+1) - 2*a(n) = sqrt(3*(a(n)^2 + 2)). Therefore a(n+1)^2 + a(n)^2 - 4*a(n+1)*a(n) - 6 = 0. - Creighton Dement, Apr 18 2005
a(n) = L(n,-4)*(-1)^n, where L is defined as in A108299; see also A001835 for L(n,+4). - Reinhard Zumkeller, Jun 01 2005
a(n) = Jacobi_P(n, 1/2, -1/2, 2)/Jacobi_P(n, -1/2, 1/2, 1). - Paul Barry, Feb 03 2006
Equals binomial transform of A026150 starting (1, 4, 10, 28, 76, ...) and double binomial transform of (1, 3, 3, 9, 9, 27, 27, 81, 81, ...). - Gary W. Adamson, Nov 30 2007
Sequence satisfies 6 = f(a(n), a(n+1)) where f(u, v) = u^2 + v^2 - 4*u*v. - Michael Somos, Sep 19 2008
a(-1-n) = -a(n). - Michael Somos, Sep 19 2008
From Franck Maminirina Ramaharo, Nov 11 2018: (Start)
a(n) = (-1)^n*(5*A125905(n) + A125905(n+1)).
E.g.f.: exp(2*x)*(cosh(sqrt(3)*x) + sqrt(3)*sinh(sqrt(3)*x)). (End)
a(n) = A061278(n+1) - A061278(n-1) for n>=2. - John P. McSorley, Jun 20 2020
From Peter Bala, May 09 2025: (Start)
a(n) = Dir(n, 2), where Dir(n, x) denotes the n-th row polynomial of the triangle A244419.
a(n) - 2*a(n-1) = 3 * A001835(n) for n >= 1.
For arbitrary x, a(n+x)^2 - 4*a(n+x)*a(n+x+1) + a(n+x+1)^2 = 6 with a(n) := (1/2) * ((1 + sqrt(3))*(2 + sqrt(3))^n + (1 - sqrt(3))*(2 - sqrt(3))^n) as above. The particular case x = 0 is noted above,
a(n+1/2) = sqrt(6) * A001353(n+1).
a(n+3/4) + a(n+1/4) = sqrt(6*sqrt(6) + 12) * A001353(n+1).
a(n+3/4) - a(n+1/4) = sqrt(2*sqrt(6) - 4) * A001075(n+1).
Sum_{n >= 1} (-1)^(n+1)/(a(n) - 1/a(n)) = 1/6 (telescoping series: for n >= 1, 1/(a(n) - 1/a(n)) = 1/A001352(n) + 1/A001352(n+1)).
Product_{n >= 1} (a(n) + 1)/(a(n) - 1) = sqrt(3) (telescoping product: Product_{n = 1..k} ((a(n) + 1)/(a(n) - 1))^2 = 3*(1 - 2/A102206(k))). (End)

A123967 Triangle read by rows: T(0,0)=1; for n >= 1 T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the tridiagonal n X n matrix with main diagonal 5,5,5,... and sub- and superdiagonals 1,1,1,... (0 <= k <= n).

Original entry on oeis.org

1, -5, 1, 24, -10, 1, -115, 73, -15, 1, 551, -470, 147, -20, 1, -2640, 2828, -1190, 246, -25, 1, 12649, -16310, 8631, -2400, 370, -30, 1, -60605, 91371, -58275, 20385, -4225, 519, -35, 1, 290376, -501150, 374115, -157800, 41140, -6790, 693, -40, 1, -1391275, 2704755, -2313450, 1142730, -359275, 74571, -10220, 892, -45, 1

Offset: 0

Gary W. Adamson and Roger L. Bagula, Oct 28 2006

Riordan array (1/(1+5*x+x^2), x/(1+5*x+x^2)). - Philippe Deléham, Feb 03 2007
Chebyshev's S(n,x-5) polynomials (exponents of x in increasing order). - Philippe Deléham, Feb 22 2012
Row sums are A125905(n). - Philippe Deléham, Feb 22 2012
Diagonal sums are (-5)^n. - Philippe Deléham, Feb 22 2012
Subtriangle of triangle given by (0, -5, 1/5, -1/5, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Feb 22 2012
Inverse of triangle in A125906. - Philippe Deléham, Feb 22 2012

			Triangle starts:
      1;
     -5,      1;
     24,    -10,     1;
   -115,     73,   -15,     1;
    551,   -470,   147,   -20,   1;
  -2640,   2828, -1190,   246, -25,   1;
  12649, -16310,  8631, -2400, 370, -30, 1;
  ...
Triangle (0, -5, 1/5, -1/5, 0, 0, 0, ...) DELTA (1, 0, 0, 0, ...) begins:
  1;
  0,     1;
  0,    -5,    1;
  0,    24,  -10,     1:
  0,  -115,   73,   -15,   1;
  0,   551, -470,   147, -20,   1;
  0, -2640, 2828, -1190, 246, -25, 1;
  ...

Eric Weisstein's World of Mathematics, Tridiagonal Matrix

Cf. A123343, A004254.

Cf. Chebyshev's S(n,x+k) polynomials : A207824 (k = 5), A207823 (k = 4), A125662 (k = 3), A078812 (k=2), A101950 (k = 1), A049310 (k = 0), A104562 (k = -1), A053122 (k = -2), A207815 (k = -3), A159764 (k = -4), A123967 (k = -5).

with(linalg): m:=proc(i,j) if i=j then 5 elif abs(i-j)=1 then 1 else 0 fi end: T:=(n,k)->coeff(charpoly(matrix(n,n,m),x),x,k): 1; for n from 1 to 9 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form

T[n_, k_] /; 0 <= k <= n := T[n, k] = T[n-1, k-1] - 5 T[n-1, k] - T[n-2, k]; T[0, 0] = 1; T[, ] = 0;
Table[T[n, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 30 2018, after Philippe Deléham *)

@CachedFunction
def A123967(n,k):
    if n< 0: return 0
    if n==0: return 1 if k == 0 else 0
    return A123967(n-1,k-1)-A123967(n-2,k)-5*A123967(n-1,k)
for n in (0..9): [A123967(n,k) for k in (0..n)] # Peter Luschny, Nov 20 2012

T(n,0) = (-1)^n*A004254(n+1).
G.f.: 1/(1+5*x+x^2 - y*x). - Philippe Deléham, Feb 22 2012
T(n,k) = T(n-1,k-1) - 5*T(n-1,k) - T(n-2,k), T(0,0) = 1, T(n,k) = 0 if k < 0 or if k > n. - Philippe Deléham, Jan 22 2014

Edited by N. J. A. Sloane, Dec 03 2006

A195503 Numerators b(n) of Pythagorean approximations b(n)/a(n) to sqrt(3).

Original entry on oeis.org

4, 15, 56, 209, 780, 2911, 10864, 40545, 151316, 564719, 2107560, 7865521, 29354524, 109552575, 408855776, 1525870529, 5694626340, 21252634831, 79315912984, 296011017105, 1104728155436, 4122901604639, 15386878263120, 57424611447841

Offset: 1

Clark Kimberling, Sep 20 2011

See A195500 for discussion and list of related sequences; see A195499 for Mathematica program.
Essentially the same as A001353, A106707, A125905 and likely also A010905. - R. J. Mathar, Sep 21 2011
If started 1, 4, 15, 56, ...., denominators a(n) of Pythagorean approximations b(n)/a(n) to sqrt(1/3). - Clark Kimberling, Sep 22 2011

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

Cf. A195500, A195499, A195531.

a(n) = A001353(n+1). - R. J. Mathar, Sep 21 2011

Empirical g.f.: x*(4-x)/(1-4*x+x^2). - Colin Barker, Jan 04 2012

A321119 a(n) = ((1 - sqrt(3))^n + (1 + sqrt(3))^n)/2^floor((n - 1)/2); n-th row common denominator of A321118.

Original entry on oeis.org

4, 2, 8, 10, 28, 38, 104, 142, 388, 530, 1448, 1978, 5404, 7382, 20168, 27550, 75268, 102818, 280904, 383722, 1048348, 1432070, 3912488, 5344558, 14601604, 19946162, 54493928, 74440090, 203374108, 277814198, 759002504, 1036816702, 2832635908, 3869452610

Offset: 0

Franck Maminirina Ramaharo, Nov 01 2018

			a(0) = ((1 - sqrt(3))^0 + (1 + sqrt(3))^0)/2^floor((0 - 1)/2) = 2*(1 + 1) = 4.

Harold J. Ahlberg, Edwin N. Nilson and Joseph L. Walsh, The Theory of Splines and Their Applications, Academic Press, 1967. See p. 47, Table 2.5.2.

Encyclopedia of Mathematics, Quadrature formula
John C. Holladay, A smoothest curve approximation, Math. Comp. Vol. 11 (1957), 233-243.
Peter Köhler, On the weights of Sard's quadrature formulas, CALCOLO Vol. 25 (1988), 169-186.
Leroy F. Meyers and Arthur Sard, Best approximate integration formulas, J. Math. Phys. Vol. 29 (1950), 118-123.
Arthur Sard, Best approximate integration formulas; best approximation formulas, American Journal of Mathematics Vol. 71 (1949), 80-91.
Isaac J. Schoenberg, Spline interpolation and best quadrature formulae, Bull. Amer. Math. Soc. Vol. 70 (1964), 143-148.
Frans Schurer, On natural cubic splines, with an application to numerical integration formulae, EUT report. WSK, Dept. of Mathematics and Computing Science Vol. 70-WSK-04 (1970), 1-32.
Index entries for linear recurrences with constant coefficients, signature (0,4,0,-1).

Cf. A002176 (common denominators of Cotesian numbers).
Cf. A321118, A321120.
Cf. A001834, A002530, A002531, A003500, A005246, A048788, A083336, A125905.

LinearRecurrence[{0, 4, 0, -1}, {4, 2, 8, 10}, 50]

a(n) := ((1 - sqrt(3))^n + (1 + sqrt(3))^n)/2^floor((n - 1)/2)$
makelist(ratsimp(a(n)), n, 0, 50);

a(n) = (((sqrt(2) - sqrt(6))/2)^n + ((sqrt(6) + sqrt(2))/2)^n)*((2 - sqrt(2))*(-1)^n + 2 + sqrt(2))/2.
a(-n) = (-1)^n*a(n).
a(n) = 2*A000034(n+1)*A002531(n).
a(2*n) = 2*A001834(n).
a(2*n+1) = 2*A003500(n).
a(n) = 4*a(n-2) - a(n-4) with a(0) = 4, a(1) = 2, a(2) = 8, a(3) = 10.
a(2*n+3) = a(2*n+1) + a(2*n+2).
a(2*n+2) = a(2*n) + 2*a(2*n+1).
G.f.: 2*(1 - x)*(2 + 3*x - x^2)/(1 - 4*x^2 + x^4).
E.g.f.: (1 + exp(-sqrt(6)*x))*((2 - sqrt(2))*exp(sqrt(2 - sqrt(3))*x) + (2 + sqrt(2))*exp(sqrt(2 + sqrt(3))*x))/2.
Lim_{n->infinity} a(2*n+1)/a(2*n) = (1 + sqrt(3))/2.

A100099 An inverse Chebyshev transform of x/(1-2x).

Original entry on oeis.org

0, 1, 2, 7, 16, 46, 110, 295, 720, 1870, 4612, 11782, 29224, 73984, 184102, 463687, 1156000, 2902870, 7245020, 18161170, 45356736, 113576596, 283765132, 710118262, 1774619616, 4439253196, 11095532840, 27749232700, 69363052600

Offset: 0

Paul Barry, Nov 04 2004

Image of x/(1-2*x) under the transform g(x)->(1/sqrt(1-4*x^2))*g(x*c(x^2)), where c(x) is the g.f. of the Catalan numbers A000108. This is the inverse of the Chebyshev transform which takes A(x) to ((1-x^2)/(1+x^2))*A(x/(1+x^2)).

Hankel transform is A125905(n-1), the alternating sign version of A001353. - Paul Barry, Nov 25 2007

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

CoefficientList[Series[Sqrt[1-4*x^2]*(Sqrt[1-4*x^2]+4*x-1)/(2*(5*x-2)*(4*x^2-1)), {x, 0, 20}], x] (* Vaclav Kotesovec, Feb 01 2014 *)

G.f.: sqrt(1-4x^2)(sqrt(1-4x^2)+4x-1)/(2(5x-2)(4x^2-1)).
a(n) = Sum_{k=0..floor(n/2)} binomial(n, k)*(2^(n-2*k)-0^(n-2*k))/2.
a(n) = Sum_{k=0..n} C(n,floor(k/2))*A001045(n-k). - Paul Barry, Nov 25 2007
Conjecture: 2n*a(n) +(-13n+16)*a(n-1) +4(3n-8)*a(n-2) +4(13n-29)*a(n-3) +80(3-n)*a(n-4)=0. - R. J. Mathar, Dec 14 2011
a(n) ~ 5^n / 2^(n+1). - Vaclav Kotesovec, Feb 01 2014

A103625 a(n) = 3 + 7a(n-2) + sqrt(1 + 48a(n-2) + 48*a(n-2)^2), with a(1) = 0, a(2) = 0, a(3) = 2.

Original entry on oeis.org

0, 0, 2, 4, 34, 62, 480, 870, 6692, 12124, 93214, 168872, 1298310, 2352090, 18083132, 32760394, 251865544, 456293432, 3508034490, 6355347660, 48860617322, 88518573814, 680540608024, 1232904685742, 9478707895020, 17172147026580, 132021369922262, 239177153686384

Offset: 1

Pierre CAMI, Mar 29 2005

Define j(n) = sqrt(48*a(n)^2 + 48*a(n) + 1), then j(n) is prime for n=3, 4, 5, 6, 7, 25, 28, 32, 35, 48, 65, 66, 88, 96, 113, 119, 151, 155, 182, 220, 231, 316, 488, 531, 599, 722, 1049, 1176, ...
For n > 1, first member of the Diophantine pair (m,k) that satisfies 12*(m^2 + m) = k^2 + k; a(n)=m. - Herbert Kociemba, May 12 2008
Former name: Define a(1)=0, a(2)=0, a(3)=2, a(4)=4, a(5)=34, a(6)=62, a(7)=480, a(8)=870 such that from i=1 to 8: 48*a(i)^2 + 48*a(i) + 1 = j(i)^2 with j(1)=1, j(2)=1, j(3)=17, j(4)=31, j(5)=239, j(6)=433, j(7)=3329, j(8)=6031. Then a(n) = a(n-8) + 28*sqrt(48*(a(n-4)^2) + 48*a(n-4) + 1). - G. C. Greubel, Mar 22 2024

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

Cf. A053141, A103200, A103737, A125905.

R:=PowerSeriesRing(Integers(), 30); [0,0] cat Coefficients(R!(2*(x^2+x+1)/(1-x-14*x^2+14*x^3+x^4-x^5))); // G. C. Greubel, Jul 15 2018

a[1]=0; a[2]=0; a[3]=2; a[n_]:=a[n]= 3+7a[n-2]+Sqrt[1+48a[n-2]+48a[n-2]^2]; Table[a[n],{n,1,20}] (* Herbert Kociemba, May 12 2008 *)
Rest@CoefficientList[Series[2*x^3*(1+x+x^2)/(1-x-14*x^2+14*x^3+x^4-x^5), {x,0,30}], x] (* G. C. Greubel, Jul 15 2018 *)
LinearRecurrence[{1,14,-14,-1,1},{0,0,2,4,34},30] (* Harvey P. Dale, Jun 04 2021 *)

my(x='x+O('x^30)); concat([0,0], Vec(2*x^3*(1+x+x^2)/(1-x-14*x^2+14*x^3 + x^4-x^5))) \\ G. C. Greubel, Jul 15 2018

@CachedFunction
def b(n): return chebyshev_U(n, -2) # A125905
def A103625(n): return (1/8)*(-16*int(n==0) -4 +5*(-1)^n*(3*b(n) +11*b(n-1)) +5*b(n) +19*b(n-1))
[A103625(n) for n in range(1,41)] # G. C. Greubel, Mar 22 2024

G.f.: 2*x^3*(1+x+x^2)/((1-x)*(1-4*x+x^2)*(1+4*x+x^2)). - Ralf Stephan, May 18 2007
a(n) = (1/8)*(-16*[n=0] - 4 + 5*(-1)^n*(3*A125905(n) + 11*A125905(n-1)) + (5*A125905(n) + 19*A125905(n-1))), where A125905(n) = ChebyshevU(n, -2). - G. C. Greubel, Mar 22 2024
E.g.f.: (15*cosh(sqrt(3)*x)*(2*cosh(2*x) + sinh(2*x))/2 - sqrt(3)*(4*cosh(x) + sinh(x))*(cosh(x) + 4*sinh(x))*sinh(sqrt(3)*x) - 3*(4 + exp(x)))/6. - Stefano Spezia, Jun 02 2024

Terms a(17) onward added by G. C. Greubel, Jul 15 2018

Edited by G. C. Greubel, Mar 22 2024

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

PARI

SageMath

SageMath

Formula

Extensions

A001835 a(n) = 4*a(n-1) - a(n-2), with a(0) = 1, a(1) = 1.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

Sage

Sage

Formula

A001834 a(0) = 1, a(1) = 5, a(n) = 4*a(n-1) - a(n-2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

A123967 Triangle read by rows: T(0,0)=1; for n >= 1 T(n,k) is the coefficient of x^k in the monic characteristic polynomial of the tridiagonal n X n matrix with main diagonal 5,5,5,... and sub- and superdiagonals 1,1,1,... (0 <= k <= n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

Extensions

A195503 Numerators b(n) of Pythagorean approximations b(n)/a(n) to sqrt(3).

Views

Author

Keywords

Comments

A103625 a(n) = 3 + 7a(n-2) + sqrt(1 + 48a(n-2) + 48*a(n-2)^2), with a(1) = 0, a(2) = 0, a(3) = 2.

A111645 Expansion of (x+1)(1-3x)/((x^2+4x+1)(x^2-2*x-1)).