OFFSET
0,2
COMMENTS
Chebyshev polynomials of the first kind evaluated at 3.
This sequence gives the values of x in solutions of the Diophantine equation x^2 - 8*y^2 = 1, the corresponding values of y are in A001109. For n > 0, the ratios a(n)/A001090(n) may be obtained as convergents to sqrt(8): either successive convergents of [3; -6] or odd convergents of [2; 1, 4]. - Lekraj Beedassy, Sep 09 2003 [edited by Jon E. Schoenfield, May 04 2014]
Also gives solutions to the equation x^2 - 1 = floor(x*r*floor(x/r)) where r = sqrt(8). - Benoit Cloitre, Feb 14 2004
Appears to give all solutions greater than 1 to the equation: x^2 = ceiling(x*r*floor(x/r)) where r = sqrt(2). - Benoit Cloitre, Feb 24 2004
This sequence give numbers n such that (n-1)*(n+1)/2 is a perfect square. Remark: (i-1)*(i+1)/2 = (i^2-1)/2 = -1 = i^2 with i = sqrt(-1) so i is also in the sequence. - Pierre CAMI, Apr 20 2005
a(n) is prime for n = {1, 2, 4, 8}. Prime a(n) are {3, 17, 577, 665857}, which belong to A001601(n). a(2k-1) is divisible by a(1) = 3. a(4k-2) is divisible by a(2) = 17. a(8k-4) is divisible by a(4) = 577. a(16k-8) is divisible by a(8) = 665857. - Alexander Adamchuk, Nov 24 2006
The upper principal convergents to 2^(1/2), beginning with 3/2, 17/12, 99/70, 577/408, comprise a strictly decreasing sequence; essentially, numerators=A001541 and denominators=A001542. - Clark Kimberling, Aug 26 2008
Numbers n such that sigma(n-1) and sigma(n+1) are both odd numbers. - Juri-Stepan Gerasimov, Mar 28 2011
Also, numbers such that floor(a(n)^2/2) is a square: base 2 analog of A031149, A204502, A204514, A204516, A204518, A204520, A004275, A001075. - M. F. Hasler, Jan 15 2012
Numbers such that 2n^2 - 2 is a square. Also integer square roots of the expression 2*n^2 + 1, at values of n given by A001542. Also see A228405 regarding 2n^2 -+ 2^k generally for k >= 0. - Richard R. Forberg, Aug 20 2013
Values of x (or y) in the solutions to x^2 - 6xy + y^2 + 8 = 0. - Colin Barker, Feb 04 2014
Panda and Ray call the numbers in this sequence the Lucas-balancing numbers C_n (see references and links).
Partial sums of X or X+1 of Pythagorean triples (X,X+1,Z). - Peter M. Chema, Feb 03 2017
a(n)/A001542(n) is the closest rational approximation to sqrt(2) with a numerator not larger than a(n), and 2*A001542(n)/a(n) is the closest rational approximation to sqrt(2) with a denominator not larger than a(n). These rational approximations together with those obtained from the sequences A001653 and A002315 give a complete set of closest rational approximations to sqrt(2) with restricted numerator or denominator. a(n)/A001542(n) > sqrt(2) > 2*A001542(n)/a(n). - A.H.M. Smeets, May 28 2017
x = a(n), y = A001542(n) are solutions of the Diophantine equation x^2 - 2y^2 = 1 (Pell equation). x = 2*A001542(n), y = a(n) are solutions of the Diophantine equation x^2 - 2y^2 = -2. Both together give the set of fractional approximations for sqrt(2) obtained from limited fractions obtained from continued fraction representation to sqrt(2). - A.H.M. Smeets, Jun 22 2017
a(n) is the radius of the n-th circle among the sequence of circles generated as follows: Starting with a unit circle centered at the origin, every subsequent circle touches the previous circle as well as the two limbs of hyperbola x^2 - y^2 = 1, and lies in the region y > 0. - Kaushal Agrawal, Nov 10 2018
REFERENCES
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)
J. W. L. Glaisher, On Eulerian numbers (formulas, residues, end-figures), with the values of the first twenty-seven, Quarterly Journal of Mathematics, vol. 45, 1914, pp. 1-51.
G. K. Panda, Some fascinating properties of balancing numbers, In Proc. of Eleventh Internat. Conference on Fibonacci Numbers and Their Applications, Cong. Numerantium 194 (2009), 185-189.
A. Patra, G. K. Panda, and T. Khemaratchatakumthorn. "Exact divisibility by powers of the balancing and Lucas-balancing numbers." Fibonacci Quart., 59:1 (2021), 57-64; see C(n).
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, Query 2376, L'Intermédiaire des Mathématiciens, 11 (1904), 138-139. - N. J. A. Sloane, Mar 08 2022
LINKS
T. D. Noe, Table of n, a(n) for n = 0..200
I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7 (1969), 181-193.
Christian Aebi and Grant Cairns, Lattice Equable Parallelograms, arXiv:2006.07566 [math.NT], 2020.
Jean-Paul Allouche, Zeta-regularization of arithmetic sequences, EPJ Web of Conferences (2020) Vol. 244, 01008.
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 Peel, Nouvelle Correspondance Mathématique, 4 (1878), 161-169.
John M. Campbell, An Integral Representation of Kekulé Numbers, and Double Integrals Related to Smarandache Sequences, arXiv preprint arXiv:1105.3399 [math.GM], 2011.
P. Catarino, H. Campos, and P. Vasco, On some identities for balancing and cobalancing numbers, Annales Mathematicae et Informaticae, 45 (2015) pp. 11-24.
Kwang-Wu Chen and Yu-Ren Pan, Greatest Common Divisors of Shifted Horadam Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.5.8.
S. Falcon, Relationships between Some k-Fibonacci Sequences, Applied Mathematics, 2014, 5, 2226-2234.
Morgan Fiebig, aBa Mbirika, and Jürgen Spilker, Period patterns, entry points, and orders in the Lucas sequences: theory and applications, arXiv:2408.14632 [math.NT], 2024. See p. 5.
Robert Frontczak, A Note on Hybrid Convolutions Involving Balancing and Lucas-Balancing Numbers, Applied Mathematical Sciences, Vol. 12, 2018, No. 25, 1201-1208.
Robert Frontczak, Sums of Balancing and Lucas-Balancing Numbers with Binomial Coefficients, International Journal of Mathematical Analysis (2018) Vol. 12, No. 12, 585-594.
Robert Frontczak, Powers of Balancing Polynomials and Some Consequences for Fibonacci Sums, International Journal of Mathematical Analysis (2019) Vol. 13, No. 3, 109-115.
Robert Frontczak, Identities for generalized balancing numbers, Notes on Number Theory and Discrete Mathematics (2019) Vol. 25, No. 2, 169-180.
Robert Frontczak and Taras Goy, Additional close links between balancing and Lucas-balancing polynomials, arXiv:2007.14048 [math.NT], 2020.
Robert Frontczak and Taras Goy, More Fibonacci-Bernoulli relations with and without balancing polynomials, arXiv:2007.14618 [math.NT], 2020.
Robert Frontczak and Taras Goy, Lucas-Euler relations using balancing and Lucas-balancing polynomials, arXiv:2009.09409 [math.NT], 2020.
O. Khadir, K. Liptai, and L. Szalay, On the Shifted Product of Binary Recurrences, J. Int. Seq. 13 (2010), 10.6.1.
J. M. Katri and D. R. Byrkit, Problem E1976, Amer. Math. Monthly, 75 (1968), 683-684.
Tanya Khovanova, Recursive Sequences
D. H. Lehmer, A cotangent analogue of continued fractions, Duke Math. J., 4 (1935), 323-340.
D. H. Lehmer, A cotangent analogue of continued fractions, Duke Math. J., 4 (1935), 323-340. [Annotated scanned copy]
D. H. Lehmer, Lacunary recurrence formulas for the numbers of Bernoulli and Euler, Annals Math., 36 (1935), 637-649.
Dino Lorenzini and Z. Xiang, Integral points on variable separated curves, Preprint 2016.
aBa Mbirika, Janeè Schrader, and Jürgen Spilker, Pell and associated Pell braid sequences as GCDs of sums of k consecutive Pell, balancing, and related numbers, arXiv:2301.05758 [math.NT], 2023. See also J. Int. Seq. (2023) Vol. 26, Art. 23.6.4.
Robert Phillips, Polynomials of the form 1+4ke+4ke^2, 2008.
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
Prasanta K. Ray, Curious congruences for balancing numbers, Int. J. Contemp. Math. Sci. 7 (2012), 881-889.
Soumeya M. Tebtoub, Hacène Belbachir, and László Németh, Integer sequences and ellipse chains inside a hyperbola, Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020), hal-02918958 [math.cs], 17-18.
N. J. Wildberger, Pell's equation without irrational numbers, J. Int. Seq. 13 (2010), 10.4.3, Section 4.
Index entries for linear recurrences with constant coefficients, signature (6,-1).
FORMULA
G.f.: (1-3*x)/(1-6*x+x^2). - Barry E. Williams and Wolfdieter Lang, May 05 2000
E.g.f.: exp(3*x)*cosh(2*sqrt(2)*x). Binomial transform of A084128. - Paul Barry, May 16 2003
From N. J. A. Sloane, May 16 2003: (Start)
a(n) = sqrt(8*((A001109(n))^2) + 1).
a(n) = T(n, 3), with Chebyshev's T-polynomials A053120. (End)
a(n) = ((3+2*sqrt(2))^n + (3-2*sqrt(2))^n)/2.
a(n) = cosh(2*n*arcsinh(1)). - Herbert Kociemba, Apr 24 2008
a(n) ~ (1/2)*(sqrt(2) + 1)^(2*n). - Joe Keane (jgk(AT)jgk.org), May 15 2002
For all elements x of the sequence, 2*x^2 - 2 is a square. Limit_{n -> infinity} a(n)/a(n-1) = 3 + 2*sqrt(2). - Gregory V. Richardson, Oct 10 2002 [corrected by Peter Pein, Mar 09 2009]
From Paul Barry, Sep 18 2003: (Start)
a(n) = ((-1+sqrt(2))^n + (1+sqrt(2))^n + (1-sqrt(2))^n + (-1-sqrt(2))^n)/4 (with interpolated zeros).
E.g.f.: cosh(x)*cosh(sqrt(2)x) (with interpolated zeros). (End)
a(n) = Sum_{k >= 0} binomial(2*n, 2*k)*2^k = Sum_{k >= 0} A086645(n, k)*2^k. - Philippe Deléham, Feb 29 2004
a(n)*A002315(n+k) = A001652(2*n+k) + A001652(k) + 1; for k > 0, a(n+k)*A002315(n) = A001652(2*n+k) - A001652(k-1). - Charlie Marion, Mar 17 2003
For n > k, a(n)*A001653(k) = A011900(n+k) + A053141(n-k-1). For n <= k, a(n)*A001653(k) = A011900(n+k) + A053141(k-n). - Charlie Marion, Oct 18 2004
a(n+1) - A001542(n+1) = A090390(n+1) - A046729(n) = A001653(n); a(n+1) - 4*A079291(n+1) = (-1)^(n+1). Formula generated by the floretion - .5'i + .5'j - .5i' + .5j' - 'ii' + 'jj' - 2'kk' + 'ij' + .5'ik' + 'ji' + .5'jk' + .5'ki' + .5'kj' + e. - Creighton Dement, Nov 16 2004
a(n) = sqrt( A055997(2*n) ). - Alexander Adamchuk, Nov 24 2006
a(n) = (A000129(n)^2)*4 + (-1)^n. - Vim Wenders, Mar 28 2007
2*a(k)*A001653(n)*A001653(n+k) = A001653(n)^2 + A001653(n+k)^2 + A001542(k)^2. - Charlie Marion, Oct 12 2007
a(n) = A001333(2*n). - Ctibor O. Zizka, Aug 13 2008
a(n) = 2*A001108(n) + 1. - Paul Weisenhorn, Dec 17 2011
a(n) = sqrt(2*x^2 + 1) with x being A001542(n). - Zak Seidov, Jan 30 2013
a(2n) = 2*a(n)^2 - 1 = a(n)^2 + 2*A001542(n)^2. a(2*n+1) = 1 + 2*A002315(n)^2. - Steven J. Haker, Dec 04 2013
a(n) = 3*a(n-1) + 4*A001542(n-1); e.g., a(4) = 99 = 3*17 + 4*12. - Zak Seidov, Dec 19 2013
a(n) = cos(n * arccos(3)) = cosh(n * log(3 + 2*sqrt(2))). - Daniel Suteu, Jul 28 2016
From Ilya Gutkovskiy, Jul 28 2016: (Start)
Inverse binomial transform of A084130.
Sum_{n>=0} (-1)^n*a(n)/n! = cosh(2*sqrt(2))/exp(3) = 0.4226407909842764637... (End)
a(2*n+1) = 2*a(n)*a(n+1) - 3. - Timothy L. Tiffin, Oct 12 2016
a(n) = a(-n) for all n in Z. - Michael Somos, Jan 20 2017
a(2^n) = A001601(n+1). - A.H.M. Smeets, May 28 2017
a(n) = S(n, 6) - 3*S(n-1, 6), for n >= 0, with S(n, 6) = A001109(n+1), (Chebyshev S of A049310). See the first comment and the formula a(n) = T(n, 3). - Wolfdieter Lang, Nov 22 2020
From Peter Bala, Dec 31 2021: (Start)
a(n) = [x^n] (3*x + sqrt(1 + 8*x^2))^n.
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) hold for all prime p and positive integers n and k.
O.g.f. A(x) = 1 + x*d/dx(log(B(x))), where B(x) = 1/sqrt(1 - 6*x + x^2) is the o.g.f. of A001850. (End)
From Peter Bala, Aug 17 2022: (Start)
Sum_{n >= 1} 1/(a(n) - 2/a(n)) = 1/2.
Sum_{n >= 1} (-1)^(n+1)/(a(n) + 1/a(n)) = 1/4.
Sum_{n >= 1} 1/(a(n)^2 - 2) = 1/2 - 1/sqrt(8). (End)
EXAMPLE
99^2 + 99^2 = 140^2 + 2. - Carmine Suriano, Jan 05 2015
G.f. = 1 + 3*x + 17*x^2 + 99*x^3 + 577*x^4 + 3363*x^5 + 19601*x^6 + 114243*x^7 + ...
MAPLE
a[0]:=1: a[1]:=3: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..20); # Zerinvary Lajos, Jul 26 2006
A001541:=-(-1+3*z)/(1-6*z+z**2); # Simon Plouffe in his 1992 dissertation
MATHEMATICA
Table[Simplify[(1/2) (3 + 2 Sqrt[2])^n + (1/2) (3 - 2 Sqrt[2])^n], {n, 0, 20}] (* Artur Jasinski, Feb 10 2010 *)
a[ n_] := If[n == 0, 1, With[{m = Abs @ n}, m Sum[4^i Binomial[m + i, 2 i]/(m + i), {i, 0, m}]]]; (* Michael Somos, Jul 11 2011 *)
a[ n_] := ChebyshevT[ n, 3]; (* Michael Somos, Jul 11 2011 *)
LinearRecurrence[{6, -1}, {1, 3}, 50] (* Vladimir Joseph Stephan Orlovsky, Feb 12 2012 *)
PROG
(PARI) {a(n) = real((3 + quadgen(32))^n)}; /* Michael Somos, Apr 07 2003 */
(PARI) {a(n) = subst( poltchebi( abs(n)), x, 3)}; /* Michael Somos, Apr 07 2003 */
(PARI) {a(n) = if( n<0, a(-n), polsym(1 - 6*x + x^2, n) [n+1] / 2)}; /* Michael Somos, Apr 07 2003 */
(PARI) {a(n) = polchebyshev( n, 1, 3)}; /* Michael Somos, Jul 11 2011 */
(PARI) a(n)=([1, 2, 2; 2, 1, 2; 2, 2, 3]^n)[3, 3] \\ Vim Wenders, Mar 28 2007
(Magma) [n: n in [1..10000000] |IsSquare(8*(n^2-1))]; // Vincenzo Librandi, Nov 18 2010
(Haskell)
a001541 n = a001541_list !! (n-1)
a001541_list =
1 : 3 : zipWith (-) (map (* 6) $ tail a001541_list) a001541_list
-- Reinhard Zumkeller, Oct 06 2011
(Scheme, with memoization-macro definec)
(definec (A001541 n) (cond ((zero? n) 1) ((= 1 n) 3) (else (- (* 6 (A001541 (- n 1))) (A001541 (- n 2))))))
;; Antti Karttunen, Oct 04 2016
KEYWORD
nonn,easy,nice
AUTHOR
STATUS
approved