# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/
Search: id:a000129
Showing 1-1 of 1
%I A000129 M1413 N0552 #1052 Feb 16 2025 08:32:20
%S A000129 0,1,2,5,12,29,70,169,408,985,2378,5741,13860,33461,80782,195025,
%T A000129 470832,1136689,2744210,6625109,15994428,38613965,93222358,225058681,
%U A000129 543339720,1311738121,3166815962,7645370045,18457556052,44560482149,107578520350,259717522849
%N A000129 Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).
%C A000129 Sometimes also called lambda numbers.
%C A000129 Also denominators of continued fraction convergents to sqrt(2): 1, 3/2, 7/5, 17/12, 41/29, 99/70, 239/169, 577/408, 1393/985, 3363/2378, 8119/5741, 19601/13860, 47321/33461, 114243/80782, ... = A001333/A000129.
%C A000129 Number of lattice paths from (0,0) to the line x=n-1 consisting of U=(1,1), D=(1,-1) and H=(2,0) steps (i.e., left factors of Grand Schroeder paths); for example, a(3)=5, counting the paths H, UD, UU, DU and DD. - _Emeric Deutsch_, Oct 27 2002
%C A000129 a(2*n) with b(2*n) := A001333(2*n), n >= 1, give all (positive integer) solutions to Pell equation b^2 - 2*a^2 = +1 (see Emerson reference). a(2*n+1) with b(2*n+1) := A001333(2*n+1), n >= 0, give all (positive integer) solutions to Pell equation b^2 - 2*a^2 = -1.
%C A000129 Bisection: a(2*n+1) = T(2*n+1, sqrt(2))/sqrt(2) = A001653(n), n >= 0 and a(2*n) = 2*S(n-1,6) = 2*A001109(n), n >= 0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second kind. S(-1,x)=0. See A053120, resp. A049310. - _Wolfdieter Lang_, Jan 10 2003
%C A000129 Consider the mapping f(a/b) = (a + 2b)/(a + b). Taking a = b = 1 to start with and carrying out this mapping repeatedly on each new (reduced) rational number gives the following sequence 1/1, 3/2, 7/5, 17/12, 41/29, ... converging to 2^(1/2). Sequence contains the denominators. - _Amarnath Murthy_, Mar 22 2003
%C A000129 This is also the Horadam sequence (0,1,1,2). Limit_{n->oo} a(n)/a(n-1) = sqrt(2) + 1 = A014176. - _Ross La Haye_, Aug 18 2003
%C A000129 Number of 132-avoiding two-stack sortable permutations.
%C A000129 From _Herbert Kociemba_, Jun 02 2004: (Start)
%C A000129 For n > 0, the number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 4 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 3.
%C A000129 Number of (s(0), s(1), ..., s(n)) such that 0 < s(i) < 4 and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 1, s(n) = 2. (End)
%C A000129 Counts walks of length n from a vertex of a triangle to another vertex to which a loop has been added. - Mario Catalani (mario.catalani(AT)unito.it), Jul 23 2004
%C A000129 Apart from initial terms, Pisot sequence P(2,5). See A008776 for definition of Pisot sequences. - _David W. Wilson_
%C A000129 Sums of antidiagonals of A038207 [Pascal's triangle squared]. - _Ross La Haye_, Oct 28 2004
%C A000129 The Pell primality test is "If N is an odd prime, then P(N)-Kronecker(2,N) is divisible by N". "Most" composite numbers fail this test, so it makes a useful pseudoprimality test. The odd composite numbers which are Pell pseudoprimes (i.e., that pass the above test) are in A099011. - _Jack Brennen_, Nov 13 2004
%C A000129 a(n) = sum of n-th row of triangle in A008288 = A094706(n) + A000079(n). - _Reinhard Zumkeller_, Dec 03 2004
%C A000129 Pell trapezoids (cf. A084158); for n > 0, A001109(n) = (a(n-1) + a(n+1))*a(n)/2; e.g., 1189 = (12+70)*29/2. - _Charlie Marion_, Apr 01 2006
%C A000129 (0!a(1), 1!a(2), 2!a(3), 3!a(4), ...) and (1,-2,-2,0,0,0,...) form a reciprocal pair under the list partition transform and associated operations described in A133314. - _Tom Copeland_, Oct 29 2007
%C A000129 Let C = (sqrt(2)+1) = 2.414213562..., then for n > 1, C^n = a(n)*(1/C) + a(n+1). Example: C^3 = 14.0710678... = 5*(0.414213562...) + 12. Let X = the 2 X 2 matrix [0, 1; 1, 2]; then X^n * [1, 0] = [a(n-1), a(n); a(n), a(n+1)]. a(n) = numerator of n-th convergent to (sqrt(2)-1) = 0.414213562... = [2, 2, 2, ...], the convergents being [1/2, 2/5, 5/12, ...]. - _Gary W. Adamson_, Dec 21 2007
%C A000129 A = sqrt(2) = 2/2 + 2/5 + 2/(5*29) + 2/(29*169) + 2/(169*985) + ...; B = ((5/2) - sqrt(2)) = 2/2 + 2/(2*12) + 2/(12*70) + 2/(70*408) + 2/(408*2378) + ...; A+B = 5/2. C = 1/2 = 2/(1*5) + 2/(2*12) + 2/(5*29) + 2/(12*70) + 2/(29*169) + ... - _Gary W. Adamson_, Mar 16 2008
%C A000129 From _Clark Kimberling_, Aug 27 2008: (Start)
%C A000129 Related convergents (numerator/denominator):
%C A000129 lower principal convergents: A002315/A001653
%C A000129 upper principal convergents: A001541/A001542
%C A000129 intermediate convergents: A052542/A001333
%C A000129 lower intermediate convergents: A005319/A001541
%C A000129 upper intermediate convergents: A075870/A002315
%C A000129 principal and intermediate convergents: A143607/A002965
%C A000129 lower principal and intermediate convergents: A143608/A079496
%C A000129 upper principal and intermediate convergents: A143609/A084068. (End)
%C A000129 Equals row sums of triangle A143808 starting with offset 1. - _Gary W. Adamson_, Sep 01 2008
%C A000129 Binomial transform of the sequence:= 0,1,0,2,0,4,0,8,0,16,..., powers of 2 alternating with zeros. - _Philippe Deléham_, Oct 28 2008
%C A000129 a(n) is also the sum of the n-th row of the triangle formed by starting with the top two rows of Pascal's triangle and then each next row has a 1 at both ends and the interior values are the sum of the three numbers in the triangle above that position. - Patrick Costello (pat.costello(AT)eku.edu), Dec 07 2008
%C A000129 Starting with offset 1 = eigensequence of triangle A135387 (an infinite lower triangular matrix with (2,2,2,...) in the main diagonal and (1,1,1,...) in the subdiagonal). - _Gary W. Adamson_, Dec 29 2008
%C A000129 Starting with offset 1 = row sums of triangle A153345. - _Gary W. Adamson_, Dec 24 2008
%C A000129 From _Charlie Marion_, Jan 07 2009: (Start)
%C A000129 In general, denominators, a(k,n) and numerators, b(k,n), of continued fraction convergents to sqrt((k+1)/k) may be found as follows:
%C A000129 let a(k,0) = 1, a(k,1) = 2k; for n > 0, a(k,2n) = 2*a(k,2n-1) + a(k,2n-2)
%C A000129 and a(k,2n+1) = (2k)*a(k,2n) + a(k,2n-1);
%C A000129 let b(k,0) = 1, b(k,1) = 2k+1; for n > 0, b(k,2n) = 2*b(k,2n-1) + b(k,2n-2)
%C A000129 and b(k,2n+1) = (2k)*b(k,2n) + b(k,2n-1).
%C A000129 For example, the convergents to sqrt(2/1) start 1/1, 3/2, 7/5, 17/12, 41/29.
%C A000129 In general, if a(k,n) and b(k,n) are the denominators and numerators, respectively, of continued fraction convergents to sqrt((k+1)/k) as defined above, then
%C A000129 k*a(k,2n)^2 - a(k,2n-1)*a(k,2n+1) = k = k*a(k,2n-2)*a(k,2n) - a(k,2n-1)^2 and
%C A000129 b(k,2n-1)*b(k,2n+1) - k*b(k,2n)^2 = k+1 = b(k,2n-1)^2 - k*b(k,2n-2)*b(k,2n);
%C A000129 for example, if k=1 and n=3, then a(1,n) = a(n+1) and
%C A000129 1*a(1,6)^2 - a(1,5)*a(1,7) = 1*169^2 - 70*408 = 1;
%C A000129 1*a(1,4)*a(1,6) - a(1,5)^2 = 1*29*169 - 70^2 = 1;
%C A000129 b(1,5)*b(1,7) - 1*b(1,6)^2 = 99*577 - 1*239^2 = 2;
%C A000129 b(1,5)^2 - 1*b(1,4)*b(1,6) = 99^2 - 1*41*239 = 2.
%C A000129 Cf. A001333, A142238, A142239, A153313, A153314, A153315, A153316, A153317, A153318.
%C A000129 (End)
%C A000129 Starting with offset 1 = row sums of triangle A155002, equivalent to the statement that the Fibonacci sequence convolved with the Pell sequence prefaced with a "1": (1, 1, 2, 5, 12, 29, ...) = (1, 2, 5, 12, 29, ...). - _Gary W. Adamson_, Jan 18 2009
%C A000129 It appears that P(p) == 8^((p-1)/2) (mod p), p = prime; analogous to [Schroeder, p. 90]: Fp == 5^((p-1)/2) (mod p). Example: Given P(11) = 5741, == 8^5 (mod 11). Given P(17) = 11336689, == 8^8 (mod 17) since 17 divides (8^8 - P(17)). - _Gary W. Adamson_, Feb 21 2009
%C A000129 Equals eigensequence of triangle A154325. - _Gary W. Adamson_, Feb 12 2009
%C A000129 Another combinatorial interpretation of a(n-1) arises from a simple tiling scenario. Namely, a(n-1) gives the number of ways of tiling a 1 X n rectangle with indistinguishable 1 X 2 rectangles and 1 X 1 squares that come in two varieties, say, A and B. For example, with C representing the 1 X 2 rectangle, we obtain a(4)=12 from AAA, AAB, ABA, BAA, ABB, BAB, BBA, BBB, AC, BC, CA and CB. - _Martin Griffiths_, Apr 25 2009
%C A000129 a(n+1) = 2*a(n) + a(n-1), a(1)=1, a(2)=2 was used by Theon from Smyrna. - _Sture Sjöstedt_, May 29 2009
%C A000129 The n-th Pell number counts the perfect matchings of the edge-labeled graph C_2 x P_(n-1), or equivalently, the number of domino tilings of a 2 X (n-1) cylindrical grid. - _Sarah-Marie Belcastro_, Jul 04 2009
%C A000129 As a fraction: 1/79 = 0.0126582278481... or 1/9799 = 0.000102051229...(1/119 and 1/10199 for sequence in reverse). - _Mark Dols_, May 18 2010
%C A000129 Limit_{n->oo} (a(n)/a(n-1) - a(n-1)/a(n)) tends to 2.0. Example: a(7)/a(6) - a(6)/a(7) = 169/70 - 70/169 = 2.0000845... - _Gary W. Adamson_, Jul 16 2010
%C A000129 Numbers k such that 2*k^2 +- 1 is a square. - _Vincenzo Librandi_, Jul 18 2010
%C A000129 Starting (1, 2, 5, ...) = INVERTi transform of A006190: (1, 3, 10, 33, 109, ...). - _Gary W. Adamson_, Aug 06 2010
%C A000129 [u,v] = [a(n), a(n-1)] generates all Pythagorean triples [u^2-v^2, 2uv, u^2+v^2] whose legs differ by 1. - _James R. Buddenhagen_, Aug 14 2010
%C A000129 An elephant sequence, see A175654. For the corner squares six A[5] vectors, with decimal values between 21 and 336, lead to this sequence (without the leading 0). For the central square these vectors lead to the companion sequence A078057. - _Johannes W. Meijer_, Aug 15 2010
%C A000129 Let the 2 X 2 square matrix A=[2, 1; 1, 0] then a(n) = the (1,1) element of A^(n-1). - _Carmine Suriano_, Jan 14 2011
%C A000129 Define a t-circle to be a first-quadrant circle tangent to the x- and y-axes. Such a circle has coordinates equal to its radius. Let C(0) be the t-circle with radius 1. Then for n > 0, define C(n) to be the next larger t-circle which is tangent to C(n - 1). C(n) has radius A001333(2n) + a(2n)*sqrt(2) and each of the coordinates of its point of intersection with C(n + 1) is a(2n + 1) + (A001333(2n + 1)*sqrt(2))/2. See similar Comments for A001109 and A001653, Sep 14 2005. - _Charlie Marion_, Jan 18 2012
%C A000129 A001333 and A000129 give the diagonal numbers described by Theon from Smyrna. - _Sture Sjöstedt_, Oct 20 2012
%C A000129 Pell numbers could also be called "silver Fibonacci numbers", since, for n >= 1, F(n+1) = ceiling(phi*F(n)), if n is even and F(n+1) = floor(phi*F(n)), if n is odd, where phi is the golden ratio, while a(n+1) = ceiling(delta*a(n)), if n is even and a(n+1) = floor(delta*a(n)), if n is odd, where delta = delta_S = 1+sqrt(2) is the silver ratio. - _Vladimir Shevelev_, Feb 22 2013
%C A000129 a(n) is the number of compositions (ordered partitions) of n-1 into two sorts of 1's and one sort of 2's. Example: the a(3)=5 compositions of 3-1=2 are 1+1, 1+1', 1'+1, 1'+1', and 2. - _Bob Selcoe_, Jun 21 2013
%C A000129 Between every two consecutive squares of a 1 X n array there is a flap that can be folded over one of the two squares. Two flaps can be lowered over the same square in 2 ways, depending on which one is on top. The n-th Pell number counts the ways n-1 flaps can be lowered. For example, a sideway representation for the case n = 3 squares and 2 flaps is \\., .//, \./, ./_., ._\., where . is an empty square. - _Jean M. Morales_, Sep 18 2013
%C A000129 Define a(-n) to be a(n) for n odd and -a(n) for n even. Then a(n) = A005319(k)*(a(n-2k+1) - a(n-2k)) + a(n-4k) = A075870(k)*(a(n-2k+2) - a(n-2k+1)) - a(n-4k+2). - _Charlie Marion_, Nov 26 2013
%C A000129 An alternative formulation of the combinatorial tiling interpretation listed above: Except for n=0, a(n-1) is the number of ways of partial tiling a 1 X n board with 1 X 1 squares and 1 X 2 dominoes. - _Matthew Lehman_, Dec 25 2013
%C A000129 Define a(-n) to be a(n) for n odd and -a(n) for n even. Then a(n) = A077444(k)*a(n-2k+1) + a(n-4k+2). This formula generalizes the formula used to define this sequence. - _Charlie Marion_, Jan 30 2014
%C A000129 a(n-1) is the top left entry of the n-th power of any of the 3 X 3 matrices [0, 1, 1; 1, 1, 1; 0, 1, 1], [0, 1, 1; 0, 1, 1; 1, 1, 1], [0, 1, 0; 1, 1, 1; 1, 1, 1] or [0, 0, 1; 1, 1, 1; 1, 1, 1]. - _R. J. Mathar_, Feb 03 2014
%C A000129 a(n+1) counts closed walks on K2 containing two loops on the other vertex. Equivalently the (1,1) entry of A^(n+1) where the adjacency matrix of digraph is A=(0,1;1,2). - _David Neil McGrath_, Oct 28 2014
%C A000129 For n >= 1, a(n) equals the number of ternary words of length n-1 avoiding runs of zeros of odd lengths. - _Milan Janjic_, Jan 28 2015
%C A000129 This is a divisibility sequence (i.e., if n|m then a(n)|a(m)). - _Tom Edgar_, Jan 28 2015
%C A000129 A strong divisibility sequence, that is, gcd(a(n), a(m)) = a(gcd(n, m)) for all positive integers n and m. - _Michael Somos_, Jan 03 2017
%C A000129 a(n) is the number of compositions (ordered partitions) of n-1 into two kinds of parts, n and n', when the order of the 1 does not matter, or equivalently, when the order of the 1' does not matter. Example: When the order of the 1 does not matter, the a(3)=5 compositions of 3-1=2 are 1+1, 1+1'=1+1, 1'+1', 2 and 2'. (Contrast with entry from _Bob Selcoe_ dated Jun 21 2013.) - _Gregory L. Simay_, Sep 07 2017
%C A000129 Number of weak orderings R on {1,...,n} that are weakly single-peaked w.r.t. the total ordering 1 < ... < n and for which {1,...,n} has exactly one minimal element for the weak ordering R. - _J. Devillet_, Sep 28 2017
%C A000129 Also the number of matchings in the (n-1)-centipede graph. - _Eric W. Weisstein_, Sep 30 2017
%C A000129 Let A(r,n) be the total number of ordered arrangements of an n+r tiling of r red squares and white tiles of total length n, where the individual tile lengths can range from 1 to n. A(r,0) corresponds to a tiling of r red squares only, and so A(r,0)=1. Let A_1(r,n) = Sum_{j=0..n} A(r,j) and let A_s(r,n) = Sum_{j=0..n} A_(s-1)(r,j). Then A_0(1,n) + A_2(3,n-4) + A_4(5,n-8) + ... + A_(2j) (2j+1, n-4j) = a(n) without the initial 0. - _Gregory L. Simay_, May 25 2018
%C A000129 (1, 2, 5, 12, 29, ...) is the fourth INVERT transform of (1, -2, 5, -12, 29, ...), as shown in A073133. - _Gary W. Adamson_, Jul 17 2019
%C A000129 Number of 2-compositions of n restricted to odd parts (and allowed zeros); see Hopkins & Ouvry reference. - _Brian Hopkins_, Aug 17 2020
%C A000129 Also called the 2-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence. - _Michael A. Allen_, Jan 23 2023
%C A000129 Named by Lucas (1878) after the English mathematician John Pell (1611-1685). - _Amiram Eldar_, Oct 02 2023
%C A000129 a(n) is the number of compositions of n when there are F(i) parts of size i, with i,n >= 1, F(n) the Fibonacci numbers, A000045(n) (see example below). - _Enrique Navarrete_, Dec 15 2023
%D A000129 J. Austin and L. Schneider, Generalized Fibonacci sequences in Pythagorean triple preserving sequences, Fib. Q., 58:1 (2020), 340-350.
%D A000129 P. Bachmann, Niedere Zahlentheorie (1902, 1910), reprinted Chelsea, NY, 1968, vol. 2, p. 76.
%D A000129 A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, pp. 122-125, 1964.
%D A000129 Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 941.
%D A000129 J. M. Borwein, D. H. Bailey, and R. Girgensohn, Experimentation in Mathematics, A K Peters, Ltd., Natick, MA, 2004. x+357 pp. See p. 53.
%D A000129 John Derbyshire, Prime Obsession, Joseph Henry Press, 2004, see p. 16.
%D A000129 S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.1.
%D A000129 Shaun Giberson and Thomas J. Osler, Extending Theon's Ladder to Any Square Root, Problem 3858, Elementa, No. 4 1996.
%D A000129 R. P. Grimaldi, Ternary strings with no consecutive 0's and no consecutive 1's, Congressus Numerantium, 205 (2011), 129-149.
%D A000129 Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.5 The Fibonacci and Related Sequences, p. 288.
%D A000129 Thomas Koshy, Pell and Pell-Lucas Numbers with Applications, Springer, New York, 2014.
%D A000129 Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
%D A000129 P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 43.
%D A000129 J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 224.
%D A000129 Manfred R. Schroeder, "Number Theory in Science and Communication", 5th ed., Springer-Verlag, 2009, p. 90.
%D A000129 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000129 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D A000129 David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 34.
%D A000129 D. B. West, Combinatorial Mathematics, Cambridge, 2021, p. 62.
%H A000129 Simone Sandri, Table of n, a(n) for n = 0..1000 (first 500 terms from N. J. A. Sloane)
%H A000129 M. Abrate, S. Barbero, U. Cerruti, and N. Murru, Construction and composition of rooted trees via descent functions, Algebra, Volume 2013 (2013), Article ID 543913, 11 pages.
%H A000129 Michael A. Allen and Kenneth Edwards, Fence tiling derived identities involving the metallonacci numbers squared or cubed, Fib. Q. 60:5 (2022) 5-17.
%H A000129 Paraskevas K. Alvanos and Konstantinos A. Draziotis, Integer Solutions of the Equation y^2 = Ax^4 + B, Journal of Integer Sequences, Vol. 18 (2015), Article 15.4.4.
%H A000129 Ayoub B. Ayoub, Fibonacci-like sequences and Pell equations, The College Mathematics Journal, Vol. 38 (2007), pp. 49-53.
%H A000129 Ovidiu Bagdasar, Eve Hedderwick, and Ioan-Lucian Popa, On the ratios and geometric boundaries of complex Horadam sequences, Electronic Notes in Discrete Mathematics (2018) Vol. 67, 63-70.
%H A000129 Aseem R. Baranwal and Jeffrey Shallit, Critical exponent of infinite balanced words via the Pell number system, arXiv:1902.00503 [cs.FL], 2019.
%H A000129 Elena Barcucci, Antonio Bernini, and Renzo Pinzani, A Gray code for a regular language, Semantic Sensor Networks Workshop 2018, CEUR Workshop Proceedings (2018) Vol. 2113.
%H A000129 Jean-Luc Baril, Classical sequences revisited with permutations avoiding dotted pattern, Electronic Journal of Combinatorics, 18 (2011), #P178.
%H A000129 Jean-Luc Baril, Sergey Kirgizov, and Armen Petrossian, Motzkin paths with a restricted first return decomposition, Integers (2019) Vol. 19, A46.
%H A000129 M. Barnabei, F. Bonetti, and M. Silimbani, Two permutation classes related to the Bubble Sort operator, Electronic Journal of Combinatorics 19(3) (2012), #P25.
%H A000129 Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.
%H A000129 Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
%H A000129 Sarah-Marie Belcastro, Domino Tilings of 2 X n Grids (or Perfect Matchings of Grid Graphs) on Surfaces, J. Integer Seq. 26 (2023), Article 23.5.6.
%H A000129 J. Bodeen, S. Butler, T. Kim, X. Sun, and S. Wang, Tiling a strip with triangles, El. J. Combinat. 21 (1) (2014) P1.7.
%H A000129 Latham Boyle and Paul J. Steinhardt, Self-Similar One-Dimensional Quasilattices, arXiv preprint arXiv:1608.08220 [math-ph], 2016.
%H A000129 B. Bradie, Extensions and Refinements of some properties of sums involving Pell Numbers, Miss. J. Math. Sci 22 (1) (2010) 37-43.
%H A000129 Jhon J. Bravo, Jose L. Herrera, and José L. Ramírez, Combinatorial Interpretation of Generalized Pell Numbers, J. Int. Seq., Vol. 23 (2020), Article 20.2.1.
%H A000129 Dorota Bród, On a New One Parameter Generalization of Pell Numbers, Annales Mathematicae Silesianae 33 (2019), 66-76.
%H A000129 Steve Butler, Jason Ekstrand, and Steven Osborne, Counting Tilings by Taking Walks in a Graph, A Project-Based Guide to Undergraduate Research in Mathematics, Birkhäuser, Cham (2020), see page 165.
%H A000129 P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
%H A000129 Geoffrey B. Campbell and Aleksander Zujev, Gaussian integer solutions for the fifth power taxicab number problem, arXiv:1511.07424 [math.NT], 2015.
%H A000129 Frédéric Chapoton, A note on gamma triangles and local gamma vectors, arXiv:1809.00575 [math.CO], 2018.
%H A000129 C. O. Chow, S. M. Ma, T. Mansour, and M. Shattuck, Counting permutations by cyclic peaks and valleys, Annales Mathematicae et Informaticae, (2014), Vol. 43, pp. 43-54.
%H A000129 Hongshen Chua, A Study of Second-Order Linear Recurrence Sequences via Continuants, J. Int. Seq. (2023) Vol. 26, Art. 23.8.8.
%H A000129 M. Couceiro, J. Devillet, and J.-L. Marichal, Quasitrivial semigroups: characterizations and enumerations, arXiv:1709.09162 [math.RA], 2017.
%H A000129 Phan Thuan Do, Thi Thu Huong Tran, and Vincent Vajnovszki, Exhaustive generation for permutations avoiding a (colored) regular sets of patterns, arXiv:1809.00742 [cs.DM], 2018.
%H A000129 C. M. da Fonseca, Unifying some Pell and Fibonacci identities, Applied Mathematics and Computation, Volume 236, Jun 01 2014, Pages 41-42.
%H A000129 Mahadi Ddamulira, On the x-coordinates of Pell equations which are products of two Pell numbers, arXiv:1906.06330 [math.NT], 2019.
%H A000129 E. Deutsch, A formula for the Pell numbers, Problem 10663, Amer. Math. Monthly 107 (No. 4, 2000), solutions pp. 370-371.
%H A000129 Antonio J. Di Scala, Nadir Murru, and Carlo Sanna, Lucas pseudoprimes and the Pell conic, arXiv:2001.00353 [math.NT], 2020.
%H A000129 E. S. Egge and T. Mansour, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, arXiv:math/0205206 [math.CO], 2002.
%H A000129 Shalosh B. Ekhad and Tewodros Amdeberhan, Solution to problem #10663 (AMM).
%H A000129 C. Elsner, On Error Sums for Square Roots of Positive Integers with Applications to Lucas and Pell Numbers, J. Int. Seq. 17 (2014) # 14.4.4.
%H A000129 E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart., 7 (1969), pp. 231-242, Ex. 1, pp. 237-238.
%H A000129 Sergio Falcón, Relationships between Some k-Fibonacci Sequences, Applied Mathematics, 2014, 5, 2226-2234.
%H A000129 Sergio Falcón, Generating Function of Some k-Fibonacci and k-Lucas Sequences, International Journal of Innovation in Science and Mathematics (2019) Vol. 7, Issue 2, 2347-9051.
%H A000129 Sergio Falcón, Binomial Transform of the Generalized k-Fibonacci Numbers, Communications in Mathematics and Applications (2019) Vol. 10, No. 3, 643-651.
%H A000129 Bakir Farhi, Summation of Certain Infinite Lucas-Related Series, J. Int. Seq., Vol. 22 (2019), Article 19.1.6.
%H A000129 M. C. Firengiz and A. Dil, Generalized Euler-Seidel method for second order recurrence relations, Notes on Number Theory and Discrete Mathematics, Vol. 20, 2014, No. 4, 21-32.
%H A000129 Felix Flicker, Time quasilattices in dissipative dynamical systems, arXiv:1707.09371 [nlin.CD], 2017. Also SciPost Phys. 5, 001 (2018).
%H A000129 Robert Frontczak and Taras Goy, Mersenne-Horadam identities using generating functions, Carpathian Math. Publ. (2020) Vol. 12, No. 1, 34-45.
%H A000129 Shaun Giberson and Thomas J. Osler, Extending Theon's Ladder to Any Square Root, College Mathematics Journal, May, 2004.
%H A000129 Juan B. Gil and Aaron Worley, Generalized metallic means, arXiv:1901.02619 [math.NT], 2019.
%H A000129 Taras Goy, Pell numbers identities from Toeplitz-Hessenberg determinants, Novi Sad J. Math., 49 (2) (2019), 87-94.
%H A000129 Martin Griffiths, Pell identities via a quadratic field, International Journal of Mathematical Education in Science and Technology, 2013.
%H A000129 R. P. Grimaldi, Tilings, Compositions, and Generalizations, J. Int. Seq. 13 (2010), 10.6.5.
%H A000129 M. A. Gruber, Artemas Martin, A. H. Bell, J. H. Drummond, A. H. Holmes and H. C. Wilkes, Problem 47, Amer. Math. Monthly, 4 (1897), 25-28.
%H A000129 Tian-Xiao He, Peter J.-S. Shiue, Zihan Nie, and Minghao Chen, Recursive sequences and Girard-Waring identities with applications in sequence transformation, Electronic Research Archive (2020) Vol. 28, No. 2, 1049-1062.
%H A000129 R. J. Hetherington, Letter to N. J. A. Sloane, Oct 26 1974
%H A000129 Gábor Hetyei, The type B permutohedron and the poset of intervals as a Tchebyshev transform, University of North Carolina-Charlotte (2019).
%H A000129 Andreas M. Hinz and Paul K. Stockmeyer, Precious Metal Sequences and Sierpinski-Type Graphs, J. Integer Seq., Vol 25 (2022), Article 22.4.8.
%H A000129 Nick Hobson, Python program for this sequence
%H A000129 Brian Hopkins and Stéphane Ouvry, Combinatorics of Multicompositions, arXiv:2008.04937 [math.CO], 2020.
%H A000129 A. F. Horadam, Special Properties of the Sequence W(n){a,b; p,q}, Fib. Quart., Vol. 5, No. 5 (1967), pp. 424-434.
%H A000129 A. F. Horadam, Pell Identities, Fib. Quart., Vol. 9, No. 3, 1971, pp. 245-252, 263.
%H A000129 Haruo Hosoya, What Can Mathematical Chemistry Contribute to the Development of Mathematics?, HYLE--International Journal for Philosophy of Chemistry, Vol. 19, No.1 (2013), pp. 87-105.
%H A000129 INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 135
%H A000129 Milan Janjić, On Linear Recurrence Equations Arising from Compositions of Positive Integers, J. Int. Seq. 18 (2015), #15.4.7.
%H A000129 Milan Janjić, Words and Linear Recurrences, J. Int. Seq. 21 (2018), #18.1.4.
%H A000129 Tanya Khovanova, Recursive Sequences.
%H A000129 Clark Kimberling, Best lower and upper approximates to irrational numbers, Elemente der Mathematik, 52 (1997) 122-126.
%H A000129 C. J. Kirchen, Letter to N. J. A. Sloane, Feb 11 1974.
%H A000129 Sergey Kitaev, Jeffrey Remmel, and Mark Tiefenbruck, Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II, Electronic Journal of Combinatorial Number Theory, Volume 15 #A16.
%H A000129 K. Kuhapatanakul, On the Sums of Reciprocal Generalized Fibonacci Numbers, J. Int. Seq. 16 (2013) #13.7.1.
%H A000129 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.
%H A000129 Shirley Law, Hopf Algebra of Sashes, in FPSAC 2014, Chicago, USA; Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, 2014, 621-632.
%H A000129 H. Li and T. MacHenry, Permanents and Determinants, Weighted Isobaric Polynomials, and Integer Sequences, J. Int. Seq. 16 (2013) #13.3.5, example 46.
%H A000129 Édouard Lucas, The Theory of Simply Periodic Numerical Functions, Fibonacci Association, 1969. English translation of article Théorie des Fonctions Numériques Simplement Périodiques, I, Amer. J. Math., 1 (1878), 184-240.
%H A000129 T. Mansour and M. Shattuck, A statistic on n-color compositions and related sequences, Proc. Indian Acad. Sci. (Math. Sci.) Vol. 124, No. 2, May 2014, pp. 127-140.
%H A000129 A. Moghaddamfar and H. Tajbakhsh, More Determinant Representations for Sequences, Journal of Integer Sequences, 17 (2014), #14.5.6.
%H A000129 Sophie Morier-Genoud and Valentin Ovsienko, q-deformed rationals and q-continued fractions, arXiv:1812.00170 [math.CO], 2018-2020.
%H A000129 Sophie Morier-Genoud and Valentin Ovsienko, q-deformed rationals and q-continued fractions, (2019) [math].
%H A000129 Emanuele Munarini, A generalization of André-Jeannin's symmetric identity, Pure Mathematics and Applications (2018) Vol. 27, No. 1, 98-118.
%H A000129 Mariana Nagy, Simon R. Cowell, and Valeriu Beiu, Survey of Cubic Fibonacci Identities - When Cuboids Carry Weight, arXiv:1902.05944 [math.HO], 2019.
%H A000129 Ahmet Öteleş, Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers, An. Şt. Univ. Ovidius Constantą, (2019) Vol. 27, Issue 2, 109-120.
%H A000129 Ahmet Öteleş, Zekeriya Y. Karata, and Diyar O. Mustafa Zangana, Jacobsthal Numbers and Associated Hessenberg Matrices, J. Int. Seq., 21 (2018), #18.2.5.
%H A000129 Arzu Özkoç, Some algebraic identities on quadra Fibona-Pell integer sequence, Advances in Difference Equations, 2015, 2015:148.
%H A000129 Hao Pan, Arithmetic properties of q-Fibonacci numbers and q-Pell numbers, Discr. Math., 306 (2006), 2118-2127.
%H A000129 D. Panario, M. Sahin, and Q. Wang, A family of Fibonacci-like conditional sequences, INTEGERS, Vol. 13, 2013, #A78.
%H A000129 Simon Plouffe, Approximations de Séries Génératrices et Quelques Conjectures, Dissertation, Université du Québec à Montréal, 1992.
%H A000129 Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
%H A000129 Raul Prisacariu, Generating k-Pell Infinite Series Using Whittaker's Formula, The Mathematics Enthusiast: Vol. 15 : No. 3, Article 7, 2018.
%H A000129 C. Raissi and J. Pei, Towards Bounding Sequential Patterns, KDD'11, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011.
%H A000129 Franck Ramaharo, An approximate Jerusalem square whose side equals a Pell number, arXiv:1801.00466 [math.CO], 2018.
%H A000129 José L. Ramírez, Gustavo N. Rubiano, and Rodrigo de Castro, A Generalization of the Fibonacci Word Fractal and the Fibonacci Snowflake, arXiv preprint arXiv:1212.1368 [cs.DM], 2012-2014.
%H A000129 John Riordan and N. J. A. Sloane, Correspondence, 1974.
%H A000129 Michelle Rudolph-Lilith, On the Product Representation of Number Sequences, with Application to the Fibonacci Family, arXiv preprint arXiv:1508.07894 [math.NT], 2015.
%H A000129 J. L. Schiffman, Exploring the Fibonacci sequence of order two with CAS technology, Electronic Proceedings of the Twenty-fourth Annual International Conference on Technology in Collegiate Mathematics, Orlando, Florida, March 22-25, 2012, Paper C027.
%H A000129 Jon E. Schoenfield, Prime factorization of a(n) for n = 1..630. (a(422) corrected by Amiram Eldar)
%H A000129 James A. Sellers, Domino Tilings and Products of Fibonacci and Pell Numbers, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.2.
%H A000129 Mark Shattuck, Tiling proofs of some formulas for the Pell numbers of odd index, Integers, 9 (2009), 53-64.
%H A000129 Mark Shattuck, Combinatorial Proofs of Some Formulas for Triangular Tilings, Journal of Integer Sequences, 17 (2014), #14.5.5.
%H A000129 Joseph M. Shunia, Polynomial Quotient Rings and Kronecker Substitution for Deriving Combinatorial Identities, arXiv preprint arXiv:2404.00332 [math.GM], 2024.
%H A000129 Nanci Smith, Problem B-82 An Integer Valued Function, Fib. Quart., 4 (1966), 374-375.
%H A000129 Yüksel Soykan, On Generalized Third-Order Pell Numbers, Asian Journal of Advanced Research and Reports (2019) Vol. 6, No. 1, Article No. AJARR.51635, 1-18.
%H A000129 Yüksel Soykan, On Summing Formulas For Generalized Fibonacci and Gaussian Generalized Fibonacci Numbers, Advances in Research (2019) Vol. 20, No. 2, 1-15, Article No. AIR.51824.
%H A000129 Yüksel Soykan, On generalized sixth-order Pell sequences, Journal of Scientific Perspectives (2020) Vol. 4, No. 1, 49-70.
%H A000129 Yüksel Soykan, Generalized Fibonacci Numbers: Sum Formulas, Journal of Advances in Mathematics and Computer Science (2020) Vol. 35, No. 1, 89-104.
%H A000129 Yüksel Soykan, Closed Formulas for the Sums of Squares of Generalized Fibonacci Numbers, Asian Journal of Advanced Research and Reports (2020) Vol. 9, No. 1, 23-39, Article no. AJARR.55441.
%H A000129 Yüksel Soykan, Closed Formulas for the Sums of Cubes of Generalized Fibonacci Numbers: Closed Formulas of Sum_{k=0..n} W_k^3 and Sum_{k=1..n} W_(-k)^3, Archives of Current Research International (2020) Vol. 20, Issue 2, 58-69.
%H A000129 Yüksel Soykan, A Study on Generalized Fibonacci Numbers: Sum Formulas Sum_{k=0..n} k * x^k * W_k^3 and Sum_{k=1..n} k * x^k W_-k^3 for the Cubes of Terms, Earthline Journal of Mathematical Sciences (2020) Vol. 4, No. 2, 297-331.
%H A000129 Yüksel Soykan, Mehmet Gümüş, and Melih Göcen, A Study On Dual Hyperbolic Generalized Pell Numbers, Malaya Journal of Matematik, vol. 9, no. 03, July 2021, pp. 99-116.
%H A000129 Robin James Spivey, Close encounters of the golden and silver ratios, Notes on Number Theory and Discrete Mathematics (2019) Vol. 25, No. 3, 170-184.
%H A000129 R. A. Sulanke, Moments, Narayana numbers and the cut and paste for lattice paths
%H A000129 Ping Sun, Enumeration of standard Young tableaux of shifted strips with constant width, arXiv:1506.07256 [math.CO], 24 Jun 2015.
%H A000129 Tamas Szakacs, Convolution of second order linear recursive sequences I, Ann. Math. Inform. 46 (2016), 205-216.
%H A000129 Wipawee Tangjai, A Non-standard Ternary Representation of Integers, Thai J. Math (2020) Special Issue: Annual Meeting in Mathematics 2019, 269-283.
%H A000129 Gy. Tasi and F. Mizukami, Quantum algebraic-combinatoric study of the conformational properties of n-alkanes, J. Math. Chemistry, 25, 1999, 55-64 (see p. 63).
%H A000129 A. Tekcan, M. Tayat, and M. E. Ozbek, The diophantine equation 8x^2-y^2+8x(1+t)+(2t+1)^2=0 and t-balancing numbers, ISRN Combinatorics, Volume 2014, Article ID 897834, 5 pages.
%H A000129 P. E. Trier, "Almost Isosceles" Right-Angled Triangles, Eureka, No. 4, May 1940, pp. 9 - 11.
%H A000129 Andrew Vince, The average size of a connected vertex set of a graph-explicit formulas and open problems, University of Florida (2019).
%H A000129 Ian Walker, Explorations in Recursion with John Pell and the Pell Sequence.
%H A000129 Kai Wang, On k-Fibonacci Sequences And Infinite Series List of Results and Examples, 2020.
%H A000129 Eric Weisstein's World of Mathematics, Centipede Graph.
%H A000129 Eric Weisstein's World of Mathematics, Independent Edge Set.
%H A000129 Eric Weisstein's World of Mathematics, Matching.
%H A000129 Eric Weisstein's World of Mathematics, Pell Number.
%H A000129 Eric Weisstein's World of Mathematics, Pell Polynomial.
%H A000129 Eric Weisstein's World of Mathematics, Pythagoras's Constant.
%H A000129 Eric Weisstein's World of Mathematics, Square Root.
%H A000129 Eric Weisstein's World of Mathematics, Square Triangular Number.
%H A000129 Meral Yasar and Durmus Bozkurt, Another proof of Pell identities by using the determinant of tridiagonal matrix, Appl. Math. Comput., 218 (2012), pp. 6067-6071.
%H A000129 Leon Zaporski and Felix Flicker, Superconvergence of Topological Entropy in the Symbolic Dynamics of Substitution Sequences, arXiv:1811.00331 [nlin.CD], 2018.
%H A000129 Abdelmoumène Zekiri, Farid Bencherif, and Rachid Boumahdi, Generalization of an Identity of Apostol, J. Int. Seq., Vol. 21 (2018), Article 18.5.1.
%H A000129 Jianqiang Zhao, Finite Multiple zeta Values and Finite Euler Sums, arXiv preprint arXiv:1507.04917 [math.NT], 2015.
%H A000129 Index entries for "core" sequences.
%H A000129 Index entries for sequences related to Chebyshev polynomials.
%H A000129 Index to divisibility sequences.
%H A000129 Index entries for linear recurrences with constant coefficients, signature (2,1).
%F A000129 G.f.: x/(1 - 2*x - x^2). - _Simon Plouffe_ in his 1992 dissertation.
%F A000129 a(2n+1)=A001653(n). a(2n)=A001542(n). - _Ira Gessel_, Sep 27 2002
%F A000129 G.f.: Sum_{n >= 0} x^(n+1) *( Product_{k = 1..n} (2*k + x)/(1 + 2*k*x) ) = Sum_{n >= 0} x^(n+1) *( Product_{k = 1..n} (x + 1 + k)/(1 + k*x) ) = Sum_{n >= 0} x^(n+1) *( Product_{k = 1..n} (x + 3 - k)/(1 - k*x) ) may all be proved using telescoping series. - _Peter Bala_, Jan 04 2015
%F A000129 a(n) = 2*a(n-1) + a(n-2), a(0)=0, a(1)=1.
%F A000129 a(n) = ((1 + sqrt(2))^n - (1 - sqrt(2))^n)/(2*sqrt(2)).
%F A000129 For initial values a(0) and a(1), a(n) = ((a(0)*sqrt(2)+a(1)-a(0))*(1+sqrt(2))^n + (a(0)*sqrt(2)-a(1)+a(0))*(1-sqrt(2))^n)/(2*sqrt(2)). - _Shahreer Al Hossain_, Aug 18 2019
%F A000129 a(n) = integer nearest a(n-1)/(sqrt(2) - 1), where a(0) = 1. - _Clark Kimberling_
%F A000129 a(n) = Sum_{i, j, k >= 0: i+j+2k = n} (i+j+k)!/(i!*j!*k!).
%F A000129 a(n)^2 + a(n+1)^2 = a(2n+1) (1999 Putnam examination).
%F A000129 a(2n) = 2*a(n)*A001333(n). - _John McNamara_, Oct 30 2002
%F A000129 a(n) = ((-i)^(n-1))*S(n-1, 2*i), with S(n, x) := U(n, x/2) Chebyshev's polynomials of the second kind. See A049310. S(-1, x)=0, S(-2, x)= -1.
%F A000129 Binomial transform of expansion of sinh(sqrt(2)x)/sqrt(2). E.g.f.: exp(x)sinh(sqrt(2)x)/sqrt(2). - _Paul Barry_, May 09 2003
%F A000129 a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2k+1)*2^k. - _Paul Barry_, May 13 2003
%F A000129 a(n-2) + a(n) = (1 + sqrt(2))^(n-1) + (1 - sqrt(2))^(n-1) = A002203(n-1). (A002203(n))^2 - 8(a(n))^2 = 4(-1)^n. - _Gary W. Adamson_, Jun 15 2003
%F A000129 Unreduced g.f.: x(1+x)/(1 - x - 3x^2 - x^3); a(n) = a(n-1) + 3*a(n-2) + a(n-2). - Mario Catalani (mario.catalani(AT)unito.it), Jul 23 2004
%F A000129 a(n+1) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*2^(n-2k). - Mario Catalani (mario.catalani(AT)unito.it), Jul 23 2004
%F A000129 Apart from initial terms, inverse binomial transform of A052955. - _Paul Barry_, May 23 2004
%F A000129 a(n)^2 + a(n+2k+1)^2 = A001653(k)*A001653(n+k); e.g., 5^2 + 70^2 = 5*985. - _Charlie Marion_ Aug 03 2005
%F A000129 a(n+1) = Sum_{k=0..n} binomial((n+k)/2, (n-k)/2)*(1+(-1)^(n-k))*2^k/2. - _Paul Barry_, Aug 28 2005
%F A000129 a(n) = a(n-1) + A001333(n-1) = A001333(n) - a(n-1) = A001109(n)/A001333(n) = sqrt(A001110(n)/A001333(n)^2) = ceiling(sqrt(A001108(n)/2)). - _Henry Bottomley_, Apr 18 2000
%F A000129 a(n) = F(n, 2), the n-th Fibonacci polynomial evaluated at x=2. - _T. D. Noe_, Jan 19 2006
%F A000129 Define c(2n) = -A001108(n), c(2n+1) = -A001108(n+1) and d(2n) = d(2n+1) = A001652(n); then ((-1)^n)*(c(n) + d(n)) = a(n). [Proof given by _Max Alekseyev_.] - _Creighton Dement_, Jul 21 2005
%F A000129 a(r+s) = a(r)*a(s+1) + a(r-1)*a(s). - _Lekraj Beedassy_, Sep 03 2006
%F A000129 a(n) = (b(n+1) + b(n-1))/n where {b(n)} is the sequence A006645. - _Sergio Falcon_, Nov 22 2006
%F A000129 From _Miklos Kristof_, Mar 19 2007: (Start)
%F A000129 Let F(n) = a(n) = Pell numbers, L(n) = A002203 = companion Pell numbers (A002203):
%F A000129 For a >= b and odd b, F(a+b) + F(a-b) = L(a)*F(b).
%F A000129 For a >= b and even b, F(a+b) + F(a-b) = F(a)*L(b).
%F A000129 For a >= b and odd b, F(a+b) - F(a-b) = F(a)*L(b).
%F A000129 For a >= b and even b, F(a+b) - F(a-b) = L(a)*F(b).
%F A000129 F(n+m) + (-1)^m*F(n-m) = F(n)*L(m).
%F A000129 F(n+m) - (-1)^m*F(n-m) = L(n)*F(m).
%F A000129 F(n+m+k) + (-1)^k*F(n+m-k) + (-1)^m*(F(n-m+k) + (-1)^k*F(n-m-k)) = F(n)*L(m)*L(k).
%F A000129 F(n+m+k) - (-1)^k*F(n+m-k) + (-1)^m*(F(n-m+k) - (-1)^k*F(n-m-k)) = L(n)*L(m)*F(k).
%F A000129 F(n+m+k) + (-1)^k*F(n+m-k) - (-1)^m*(F(n-m+k) + (-1)^k*F(n-m-k)) = L(n)*F(m)*L(k).
%F A000129 F(n+m+k) - (-1)^k*F(n+m-k) - (-1)^m*(F(n-m+k) - (-1)^k*F(n-m-k)) = 8*F(n)*F(m)*F(k). (End)
%F A000129 a(n+1)*a(n) = 2*Sum_{k=0..n} a(k)^2 (a similar relation holds for A001333). - _Creighton Dement_, Aug 28 2007
%F A000129 a(n+1) = Sum_{k=0..n} binomial(n+1,2k+1) * 2^k = Sum_{k=0..n} A034867(n,k) * 2^k = (1/n!) * Sum_{k=0..n} A131980(n,k) * 2^k. - _Tom Copeland_, Nov 30 2007
%F A000129 Equals row sums of unsigned triangle A133156. - _Gary W. Adamson_, Apr 21 2008
%F A000129 a(n) (n >= 3) is the determinant of the (n-1) X (n-1) tridiagonal matrix with diagonal entries 2, superdiagonal entries 1 and subdiagonal entries -1. - _Emeric Deutsch_, Aug 29 2008
%F A000129 a(n) = A000045(n) + Sum_{k=1..n-1} A000045(k)*a(n-k). - _Roger L. Bagula_ and _Gary W. Adamson_, Sep 07 2008
%F A000129 From _Hieronymus Fischer_, Jan 02 2009: (Start)
%F A000129 fract((1+sqrt(2))^n) = (1/2)*(1 + (-1)^n) - (-1)^n*(1+sqrt(2))^(-n) = (1/2)*(1 + (-1)^n) - (1-sqrt(2))^n.
%F A000129 See A001622 for a general formula concerning the fractional parts of powers of numbers x > 1, which satisfy x - x^(-1) = floor(x).
%F A000129 a(n) = round((1+sqrt(2))^n/(2*sqrt(2))) for n > 0. (End) [last formula corrected by _Josh Inman_, Mar 05 2024]
%F A000129 a(n) = ((4+sqrt(18))*(1+sqrt(2))^n + (4-sqrt(18))*(1-sqrt(2))^n)/4 offset 0. - Al Hakanson (hawkuu(AT)gmail.com), Aug 08 2009
%F A000129 If p[i] = Fibonacci(i) and if A is the Hessenberg matrix of order n defined by A[i,j] = p[j-i+1] when i<=j, A[i,j]=-1 when i=j+1, and A[i,j]=0 otherwise, then, for n >= 1, a(n) = det A. - _Milan Janjic_, May 08 2010
%F A000129 a(n) = 3*a(n-1) - a(n-2) - a(n-3), n > 2. - _Gary Detlefs_, Sep 09 2010
%F A000129 From _Charlie Marion_, Apr 13 2011: (Start)
%F A000129 a(n) = 2*(a(2k-1) + a(2k))*a(n-2k) - a(n-4k).
%F A000129 a(n) = 2*(a(2k) + a(2k+1))*a(n-2k-1) + a(n-4k-2). (End)
%F A000129 G.f.: x/(1 - 2*x - x^2) = sqrt(2)*G(0)/4; G(k) = ((-1)^k) - 1/(((sqrt(2) + 1)^(2*k)) - x*((sqrt(2) + 1)^(2*k))/(x + ((sqrt(2) - 1)^(2*k + 1))/G(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, Dec 02 2011
%F A000129 In general, for n > k, a(n) = a(k+1)*a(n-k) + a(k)*a(n-k-1). See definition of Pell numbers and the formula for Sep 04 2008. - _Charlie Marion_, Jan 17 2012
%F A000129 Sum{n>=1} (-1)^(n-1)/(a(n)*a(n+1)) = sqrt(2) - 1. - _Vladimir Shevelev_, Feb 22 2013
%F A000129 From _Vladimir Shevelev_, Feb 24 2013: (Start)
%F A000129 (1) Expression a(n+1) via a(n): a(n+1) = a(n) + sqrt(2*a^2(n) + (-1)^n);
%F A000129 (2) a(n+1)^2 - a(n)*a(n+2) = (-1)^n;
%F A000129 (3) Sum_{k=1..n} (-1)^(k-1)/(a(k)*a(k+1)) = a(n)/a(n+1);
%F A000129 (4) a(n)/a(n+1) = sqrt(2) - 1 + r(n), where |r(n)| < 1/(a(n+1)*a(n+2)). (End)
%F A000129 a(-n) = -(-1)^n * a(n). - _Michael Somos_, Jun 01 2013
%F A000129 G.f.: G(0)/(2+2*x) - 1/(1+x), where G(k) = 1 + 1/(1 - x*(2*k-1)/(x*(2*k+1) - 1/G(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, Aug 10 2013
%F A000129 G.f.: Q(0)*x/2, where Q(k) = 1 + 1/(1 - x*(4*k+2 + x)/( x*(4*k+4 + x) + 1/Q(k+1) )); (continued fraction). - _Sergei N. Gladkovskii_, Aug 30 2013
%F A000129 a(n) = Sum_{r=0..n-1} Sum_{k=0..n-r-1} binomial(r+k,k)*binomial(k,n-k-r-1). - _Peter Luschny_, Nov 16 2013
%F A000129 a(n) = Sum_{k=1,3,5,...<=n} C(n,k)*2^((k-1)/2). - _Vladimir Shevelev_, Feb 06 2014
%F A000129 a(2n) = 2*a(n)*(a(n-1) + a(n)). - _John Blythe Dobson_, Mar 08 2014
%F A000129 a(k*n) = a(k)*a(k*n-k+1) + a(k-1)*a(k*n-k). - _Charlie Marion_, Mar 27 2014
%F A000129 a(k*n) = 2*a(k)*(a(k*n-k)+a(k*n-k-1)) + (-1)^k*a(k*n-2k). - _Charlie Marion_, Mar 30 2014
%F A000129 a(n+1) = (1+sqrt(2))*a(n) + (1-sqrt(2))^n. - _Art DuPre_, Apr 04 2014
%F A000129 a(n+1) = (1-sqrt(2))*a(n) + (1+sqrt(2))^n. - _Art DuPre_, Apr 04 2014
%F A000129 a(n) = F(n) + Sum_{k=1..n} F(k)*a(n-k), n >= 0 where F(n) the Fibonacci numbers A000045. - _Ralf Stephan_, May 23 2014
%F A000129 a(n) = round(sqrt(a(2n) + a(2n-1)))/2. - _Richard R. Forberg_, Jun 22 2014
%F A000129 a(n) = Product_{k divides n} A008555(k). - _Tom Edgar_, Jan 28 2015
%F A000129 a(n+k)^2 - A002203(k)*a(n)*a(n+k) + (-1)^k*a(n)^2 = (-1)^n*a(k)^2. - _Alexander Samokrutov_, Aug 06 2015
%F A000129 a(n) = 2^(n-1)*hypergeom([1-n/2, (1-n)/2], [1-n], -1) for n >= 2. - _Peter Luschny_, Dec 17 2015
%F A000129 a(n+1) = Sum_{k=0..n} binomial(n,k)*2^floor(k/2). - _Tony Foster III_, May 07 2017
%F A000129 a(n) = exp((i*Pi*n)/2)*sinh(n*arccosh(-i))/sqrt(2). - _Peter Luschny_, Mar 07 2018
%F A000129 From _Rogério Serôdio_, Mar 30 2018: (Start)
%F A000129 Some properties:
%F A000129 (1) a(n)^2 - a(n-2)^2 = 2*a(n-1)*(a(n) + a(n-2)) (see A005319);
%F A000129 (2) a(n-k)*a(n+k) = a(n)^2 + (-1)^(n+k+1)*a(k)^2;
%F A000129 (3) Sum_{k=2..n+1} a(k)*a(k-1) = a(n+1)^2 if n is odd, else a(n+1)^2 - 1 if n is even;
%F A000129 (4) a(n) - a(n-2*k+1) = (A077444(k) - 1)*a(n-2*k+1) + a(n-4*k+2);
%F A000129 (5) Sum_{k=n..n+9} a(k) = 41*A001333(n+5). (End)
%F A000129 From _Kai Wang_, Dec 30 2019: (Start)
%F A000129 a(m+r)*a(n+s) - a(m+s)*a(n+r) = -(-1)^(n+s)*a(m-n)*a(r-s).
%F A000129 a(m+r)*a(n+s) + a(m+s)*a(n+r) = (2*A002203(m+n+r+s) - (-1)^(n+s)*A002203(m-n)*A002203(r-s))/8.
%F A000129 A002203(m+r)*A002203(n+s) - A002203(m+s)*A002203(n+r) = (-1)^(n+s)*8*a(m-n)*a(r-s).
%F A000129 A002203(m+r)*A002203(n+s) - 8*a(m+s)*a(n+r) = (-1)^(n+s)*A002203(m-n)*A002203(r-s).
%F A000129 A002203(m+r)*A002203(n+s) + 8*a(m+s)*a(n+r) = 2*A002203(m+n+r+s)+ (-1)^(n+s)*8*a(m-n)*a(r-s). (End)
%F A000129 From _Kai Wang_, Jan 12 2020: (Start)
%F A000129 a(n)^2 - a(n+1)*a(n-1) = (-1)^(n-1).
%F A000129 a(n)^2 - a(n+r)*a(n-r) = (-1)^(n-r)*a(r)^2.
%F A000129 a(m)*a(n+1) - a(m+1)*a(n) = (-1)^n*a(m-n).
%F A000129 a(m-n) = (-1)^n (a(m)*A002203(n) - A002203(m)*a(n))/2.
%F A000129 a(m+n) = (a(m)*A002203(n) + A002203(m)*a(n))/2.
%F A000129 A002203(n)^2 - A002203(n+r)*A002203(n-r) = (-1)^(n-r-1)*8*a(r)^2.
%F A000129 A002203(m)*A002203(n+1) - A002203(m+1)*A002203(n) = (-1)^(n-1)*8*a(m-n).
%F A000129 A002203(m-n) = (-1)^(n)*(A002203(m)*A002203(n) - 8*a(m)*a(n) )/2.
%F A000129 A002203(m+n) = (A002203(m)*A002203(n) + 8*a(m)*a(n) )/2. (End)
%F A000129 From _Kai Wang_, Mar 03 2020: (Start)
%F A000129 Sum_{m>=1} arctan(2/a(2*m+1)) = arctan(1/2).
%F A000129 Sum_{m>=2} arctan(2/a(2*m+1)) = arctan(1/12).
%F A000129 In general, for n > 0,
%F A000129 Sum_{m>=n} arctan(2/a(2*m+1)) = arctan(1/a(2*n)). (End)
%F A000129 a(n) = (A001333(n+3*k) + (-1)^(k-1)*A001333(n-3*k)) / (20*A041085(k-1)) for any k>=1. - _Paul Curtz_, Jun 23 2021
%F A000129 Sum_{i=0..n} a(i)*J(n-i) = (a(n+1) + a(n) - J(n+2))/2 for J(n) = A001045(n). - _Greg Dresden_, Jan 05 2022
%F A000129 From _Peter Bala_, Aug 20 2022: (Start)
%F A000129 Sum_{n >= 1} 1/(a(2*n) + 1/a(2*n)) = 1/2.
%F A000129 Sum_{n >= 1} 1/(a(2*n+1) - 1/a(2*n+1)) = 1/4. Both series telescope - see A075870 and A005319.
%F A000129 Product_{n >= 1} ( 1 + 2/a(2*n) ) = 1 + sqrt(2).
%F A000129 Product_{n >= 2} ( 1 - 2/a(2*n) ) = (1/3)*(1 + sqrt(2)). (End)
%F A000129 G.f. = 1/(1 - Sum_{k>=1} Fibonacci(k)*x^k). - _Enrique Navarrete_, Dec 17 2023
%F A000129 Sum_{n >=1} 1/a(n) = 1.84220304982752858079237158327980838... - _R. J. Mathar_, Feb 05 2024
%F A000129 a(n) = ((3^(n+1) + 1)^(n-1) mod (9^(n+1) - 2)) mod (3^(n+1) - 1). - _Joseph M. Shunia_, Jun 06 2024
%e A000129 G.f. = x + 2*x^2 + 5*x^3 + 12*x^4 + 29*x^5 + 70*x^6 + 169*x^7 + 408*x^8 + 985*x^9 + ...
%e A000129 From _Enrique Navarrete_, Dec 15 2023: (Start)
%e A000129 From the comment on compositions with Fibonacci number of parts, F(n), there are F(1)=1 type of 1, F(2)=1 type of 2, F(3)=2 types of 3, F(4)=3 types of 4, F(5)=5 types of 5 and F(6)=8 types of 6.
%e A000129 The following table gives the number of compositions of n=6 with Fibonacci number of parts:
%e A000129 Composition, number of such compositions, number of compositions of this type:
%e A000129 6, 1, 8;
%e A000129 5+1, 2, 10;
%e A000129 4+2, 2, 6;
%e A000129 3+3, 1, 4;
%e A000129 4+1+1, 3, 9;
%e A000129 3+2+1, 6, 12;
%e A000129 2+2+2, 1, 1;
%e A000129 3+1+1+1, 4, 8;
%e A000129 2+2+1+1, 6, 6;
%e A000129 2+1+1+1+1, 5, 5;
%e A000129 1+1+1+1+1+1, 1, 1;
%e A000129 for a total of a(6)=70 compositions of n=6. (End).
%p A000129 A000129 := proc(n) option remember; if n <=1 then n; else 2*procname(n-1)+procname(n-2); fi; end;
%p A000129 a:= n-> (<<2|1>, <1|0>>^n)[1, 2]: seq(a(n), n=0..40); # _Alois P. Heinz_, Aug 01 2008
%p A000129 A000129 := n -> `if`(n<2, n, 2^(n-1)*hypergeom([1-n/2, (1-n)/2], [1-n], -1)):
%p A000129 seq(simplify(A000129(n)), n=0..31); # _Peter Luschny_, Dec 17 2015
%t A000129 CoefficientList[Series[x/(1 - 2*x - x^2), {x, 0, 60}], x] (* _Stefan Steinerberger_, Apr 08 2006 *)
%t A000129 Expand[Table[((1 + Sqrt[2])^n - (1 - Sqrt[2])^n)/(2Sqrt[2]), {n, 0, 30}]] (* _Artur Jasinski_, Dec 10 2006 *)
%t A000129 LinearRecurrence[{2, 1}, {0, 1}, 60] (* _Harvey P. Dale_, Jan 04 2012 *)
%t A000129 a[ n_] := With[ {s = Sqrt@2}, ((1 + s)^n - (1 - s)^n) / (2 s)] // Simplify; (* _Michael Somos_, Jun 01 2013 *)
%t A000129 Table[Fibonacci[n, 2], {n, 0, 20}] (* _Vladimir Reshetnikov_, May 08 2016 *)
%t A000129 Fibonacci[Range[0, 20], 2] (* _Eric W. Weisstein_, Sep 30 2017 *)
%t A000129 a[ n_] := ChebyshevU[n - 1, I] / I^(n - 1); (* _Michael Somos_, Oct 30 2021 *)
%o A000129 (PARI) default(realprecision, 2000); for (n=0, 4000, a=contfracpnqn(vector(n, i, 1+(i>1)))[2, 1]; if (a > 10^(10^3 - 6), break); write("b000129.txt", n, " ", a)); \\ _Harry J. Smith_, Jun 12 2009
%o A000129 (PARI) {a(n) = imag( (1 + quadgen( 8))^n )}; /* _Michael Somos_, Jun 01 2013 */
%o A000129 (PARI) {a(n) = if( n<0, -(-1)^n, 1) * contfracpnqn( vector( abs(n), i, 1 + (i>1))) [2, 1]}; /* _Michael Somos_, Jun 01 2013 */
%o A000129 (PARI) a(n)=([2, 1; 1, 0]^n)[2,1] \\ _Charles R Greathouse IV_, Mar 04 2014
%o A000129 (PARI) {a(n) = polchebyshev(n-1, 2, I) / I^(n-1)}; /* _Michael Somos_, Oct 30 2021 */
%o A000129 (Sage) [lucas_number1(n, 2, -1) for n in range(30)] # _Zerinvary Lajos_, Apr 22 2009
%o A000129 (Haskell)
%o A000129 a000129 n = a000129_list !! n
%o A000129 a000129_list = 0 : 1 : zipWith (+) a000129_list (map (2 *) $ tail a000129_list)
%o A000129 -- _Reinhard Zumkeller_, Jan 05 2012, Feb 05 2011
%o A000129 (Maxima)
%o A000129 a[0]:0$
%o A000129 a[1]:1$
%o A000129 a[n]:=2*a[n-1]+a[n-2]$
%o A000129 A000129(n):=a[n]$
%o A000129 makelist(A000129(n),n,0,30); /* _Martin Ettl_, Nov 03 2012 */
%o A000129 (Maxima) makelist((%i)^(n-1)*ultraspherical(n-1,1,-%i),n,0,24),expand; /* _Emanuele Munarini_, Mar 07 2018 */
%o A000129 (Magma) [0] cat [n le 2 select n else 2*Self(n-1) + Self(n-2): n in [1..35]]; // _Vincenzo Librandi_, Aug 08 2015
%o A000129 (GAP) a := [0,1];; for n in [3..10^3] do a[n] := 2 * a[n-1] + a[n-2]; od; A000129 := a; # _Muniru A Asiru_, Oct 16 2017
%o A000129 (Python)
%o A000129 from itertools import islice
%o A000129 def A000129_gen(): # generator of terms
%o A000129 a, b = 0, 1
%o A000129 yield from [a,b]
%o A000129 while True:
%o A000129 a, b = b, a+2*b
%o A000129 yield b
%o A000129 A000129_list = list(islice(A000129_gen(),20)) # _Chai Wah Wu_, Jan 11 2022
%Y A000129 Partial sums of A001333.
%Y A000129 2nd row of A172236.
%Y A000129 a(n) = A054456(n-1, 0), n>=1 (first column of triangle).
%Y A000129 Cf. A002203, A096669, A096670, A097075, A097076, A051927, A005409.
%Y A000129 Cf. A175181 (Pisano periods), A214028 (Entry points), A214027 (number of zeros in a fundamental period).
%Y A000129 A077985 is a signed version.
%Y A000129 INVERT transform of Fibonacci numbers (A000045).
%Y A000129 Cf. A038207.
%Y A000129 The following sequences (and others) belong to the same family: A001333, A000129, A026150, A002605, A046717, A015518, A084057, A063727, A002533, A002532, A083098, A083099, A083100, A015519.
%Y A000129 Cf. A034867, A131980, A133156, A143808, A135387, A153346, A001622, A006497, A014176 (growth power), A098316, A154325, A021083, A243399, A008555.
%Y A000129 Cf. A048739.
%Y A000129 Cf. A073133.
%Y A000129 Cf. A041085.
%Y A000129 Cf. A157103, A352361.
%Y A000129 Sequences with g.f. 1/(1-k*x-x^2) or x/(1-k*x-x^2): A000045 (k=1), this sequence (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), A243399 (k=19), A041181 (k=20).
%K A000129 nonn,easy,core,cofr,nice,frac,changed
%O A000129 0,3
%A A000129 _N. J. A. Sloane_
# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE