Displaying 1-10 of 63 results found.
Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 + ... + n.
(Formerly M2535 N1002)
+10
4660
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 136, 153, 171, 190, 210, 231, 253, 276, 300, 325, 351, 378, 406, 435, 465, 496, 528, 561, 595, 630, 666, 703, 741, 780, 820, 861, 903, 946, 990, 1035, 1081, 1128, 1176, 1225, 1275, 1326, 1378, 1431
COMMENTS
Also referred to as T(n) or C(n+1, 2) or binomial(n+1, 2) (preferred).
Also generalized hexagonal numbers: n*(2*n-1), n=0, +-1, +-2, +-3, ... Generalized k-gonal numbers are second k-gonal numbers and positive terms of k-gonal numbers interleaved, k >= 5. In this case k = 6. - Omar E. Pol, Sep 13 2011 and Aug 04 2012
Number of edges in complete graph of order n+1, K_{n+1}.
Number of legal ways to insert a pair of parentheses in a string of n letters. E.g., there are 6 ways for three letters: (a)bc, (ab)c, (abc), a(b)c, a(bc), ab(c). Proof: there are C(n+2,2) ways to choose where the parentheses might go, but n + 1 of them are illegal because the parentheses are adjacent. Cf. A002415.
For n >= 1, a(n) is also the genus of a nonsingular curve of degree n+2, such as the Fermat curve x^(n+2) + y^(n+2) = 1. - Ahmed Fares (ahmedfares(AT)my_deja.com), Feb 21 2001
From Harnack's theorem (1876), the number of branches of a nonsingular curve of order n is bounded by a(n-1)+1, and the bound can be achieved. See also A152947. - Benoit Cloitre, Aug 29 2002. Corrected by Robert McLachlan, Aug 19 2024
Number of tiles in the set of double-n dominoes. - Scott A. Brown, Sep 24 2002
Number of ways a chain of n non-identical links can be broken up. This is based on a similar problem in the field of proteomics: the number of ways a peptide of n amino acid residues can be broken up in a mass spectrometer. In general, each amino acid has a different mass, so AB and BC would have different masses. - James A. Raymond, Apr 08 2003
Triangular numbers - odd numbers = shifted triangular numbers; 1, 3, 6, 10, 15, 21, ... - 1, 3, 5, 7, 9, 11, ... = 0, 0, 1, 3, 6, 10, ... - Xavier Acloque, Oct 31 2003 [Corrected by Derek Orr, May 05 2015]
Centered polygonal numbers are the result of [number of sides * A000217 + 1]. E.g., centered pentagonal numbers (1,6,16,31,...) = 5 * (0,1,3,6,...) + 1. Centered heptagonal numbers (1,8,22,43,...) = 7 * (0,1,3,6,...) + 1. - Xavier Acloque, Oct 31 2003
Maximum number of lines formed by the intersection of n+1 planes. - Ron R. King, Mar 29 2004
Number of permutations of [n] which avoid the pattern 132 and have exactly 1 descent. - Mike Zabrocki, Aug 26 2004
Number of ternary words of length n-1 with subwords (0,1), (0,2) and (1,2) not allowed. - Olivier Gérard, Aug 28 2012
Number of ways two different numbers can be selected from the set {0,1,2,...,n} without repetition, or, number of ways two different numbers can be selected from the set {1,2,...,n} with repetition.
Conjecturally, 1, 6, 120 are the only numbers that are both triangular and factorial. - Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Mar 30 2005
Binomial transform is {0, 1, 5, 18, 56, 160, 432, ...}, A001793 with one leading zero. - Philippe Deléham, Aug 02 2005
Each pair of neighboring terms adds to a perfect square. - Zak Seidov, Mar 21 2006
Number of transpositions in the symmetric group of n+1 letters, i.e., the number of permutations that leave all but two elements fixed. - Geoffrey Critzer, Jun 23 2006
With rho(n):=exp(i*2*Pi/n) (an n-th root of 1) one has, for n >= 1, rho(n)^a(n) = (-1)^(n+1). Just use the triviality a(2*k+1) == 0 (mod (2*k+1)) and a(2*k) == k (mod (2*k)).
a(n) is the number of terms in the expansion of (a_1 + a_2 + a_3)^(n-1). - Sergio Falcon, Feb 12 2007
a(n+1) is the number of terms in the complete homogeneous symmetric polynomial of degree n in 2 variables. - Richard Barnes, Sep 06 2017
Equal to the rank (minimal cardinality of a generating set) of the semigroup PT_n\S_n, where PT_n and S_n denote the partial transformation semigroup and symmetric group on [n]. - James East, May 03 2007
a(n) gives the total number of triangles found when cevians are drawn from a single vertex on a triangle to the side opposite that vertex, where n = the number of cevians drawn+1. For instance, with 1 cevian drawn, n = 1+1 = 2 and a(n)= 2*(2+1)/2 = 3 so there is a total of 3 triangles in the figure. If 2 cevians are drawn from one point to the opposite side, then n = 1+2 = 3 and a(n) = 3*(3+1)/2 = 6 so there is a total of 6 triangles in the figure. - Noah Priluck (npriluck(AT)gmail.com), Apr 30 2007
For n >= 1, a(n) is the number of ways in which n-1 can be written as a sum of three nonnegative integers if representations differing in the order of the terms are considered to be different. In other words, for n >= 1, a(n) is the number of nonnegative integral solutions of the equation x + y + z = n-1. - Amarnath Murthy, Apr 22 2001 (edited by Robert A. Beeler)
a(n) is the number of levels with energy n + 3/2 (in units of h*f0, with Planck's constant h and the oscillator frequency f0) of the three-dimensional isotropic harmonic quantum oscillator. See the comment by A. Murthy above: n = n1 + n2 + n3 with positive integers and ordered. Proof from the o.g.f. See the A. Messiah reference. - Wolfdieter Lang, Jun 29 2007
Numbers m >= 0 such that round(sqrt(2m+1)) - round(sqrt(2m)) = 1.
Numbers m >= 0 such that ceiling(2*sqrt(2m+1)) - 1 = 1 + floor(2*sqrt(2m)).
Numbers m >= 0 such that fract(sqrt(2m+1)) > 1/2 and fract(sqrt(2m)) < 1/2, where fract(x) is the fractional part of x (i.e., x - floor(x), x >= 0). (End)
If Y and Z are 3-blocks of an n-set X, then, for n >= 6, a(n-1) is the number of (n-2)-subsets of X intersecting both Y and Z. - Milan Janjic, Nov 09 2007
a(n) is also a perfect number A000396 if n is a Mersenne prime A000668, assuming there are no odd perfect numbers. - Omar E. Pol, Sep 05 2008
The number of matches played in a round robin tournament: n*(n-1)/2 gives the number of matches needed for n players. Everyone plays against everyone else exactly once. - Georg Wrede (georg(AT)iki.fi), Dec 18 2008
-a(n+1) = E(2)*binomial(n+2,2) (n >= 0) where E(n) are the Euler numbers in the enumeration A122045. Viewed this way, a(n) is the special case k=2 in the sequence of diagonals in the triangle A153641. - Peter Luschny, Jan 06 2009
Equivalent to the first differences of successive tetrahedral numbers. See A000292. - Jeremy Cahill (jcahill(AT)inbox.com), Apr 15 2009
The general formula for alternating sums of powers is in terms of the Swiss-Knife polynomials P(n,x) A153641 2^(-n-1)(P(n,1)-(-1)^k P(n,2k+1)). Thus a(k) = |2^(-3)(P(2,1)-(-1)^k P(2,2k+1))|. - Peter Luschny, Jul 12 2009
a(n) is the smallest number > a(n-1) such that gcd(n,a(n)) = gcd(n,a(n-1)). If n is odd this gcd is n; if n is even it is n/2. - Franklin T. Adams-Watters, Aug 06 2009
The numbers along the right edge of Floyd's triangle are 1, 3, 6, 10, 15, .... - Paul Muljadi, Jan 25 2010
More generally, a(2k+1) == j*(2j-1) (mod 2k+2j+1) and
a(2k) == [-k + 2j*(j-1)] (mod 2k+2j).
Column sums of:
1 3 5 7 9 ...
1 3 5 ...
1 ...
...............
---------------
1 3 6 10 15 ...
Sum_{n>=1} 1/a(n)^2 = 4*Pi^2/3-12 = 12 less than the volume of a sphere with radius Pi^(1/3).
(End)
1/a(n+1), n >= 0, has e.g.f. -2*(1+x-exp(x))/x^2, and o.g.f. 2*(x+(1-x)*log(1-x))/x^2 (see the Stephen Crowley formula line). -1/(2*a(n+1)) is the z-sequence for the Sheffer triangle of the coefficients of the Bernoulli polynomials A196838/ A196839. - Wolfdieter Lang, Oct 26 2011
(End)
Plot the three points (0,0), (a(n), a(n+1)), (a(n+1), a(n+2)) to form a triangle. The area will be a(n+1)/2. - J. M. Bergot, May 04 2012
The sum of four consecutive triangular numbers, beginning with a(n)=n*(n+1)/2, minus 2 is 2*(n+2)^2. a(n)*a(n+2)/2 = a(a(n+1)-1). - J. M. Bergot, May 17 2012
(a(n)*a(n+3) - a(n+1)*a(n+2))*(a(n+1)*a(n+4) - a(n+2)*a(n+3))/8 = a((n^2+5*n+4)/2). - J. M. Bergot, May 18 2012
a(n)*a(n+1) + a(n+2)*a(n+3) + 3 = a(n^2 + 4*n + 6). - J. M. Bergot, May 22 2012
In general, a(n)*a(n+1) + a(n+k)*a(n+k+1) + a(k-1)*a(k) = a(n^2 + (k+2)*n + k*(k+1)). - Charlie Marion, Sep 11 2012
a(n)*a(n+3) + a(n+1)*a(n+2) = a(n^2 + 4*n + 2). - J. M. Bergot, May 22 2012
In general, a(n)*a(n+k) + a(n+1)*a(n+k-1) = a(n^2 + (k+1)*n + k-1). - Charlie Marion, Sep 11 2012
a(n)*a(n+2) + a(n+1)*a(n+3) = a(n^2 + 4*n + 3). - J. M. Bergot, May 22 2012
Three points (a(n),a(n+1)), (a(n+1),a(n)) and (a(n+2),a(n+3)) form a triangle with area 4*a(n+1). - J. M. Bergot, May 23 2012
a(n) + a(n+k) = (n+k)^2 - (k^2 + (2n-1)*k -2n)/2. For k=1 we obtain a(n) + a(n+1) = (n+1)^2 (see below). - Charlie Marion, Oct 02 2012
In n-space we can define a(n-1) nontrivial orthogonal projections. For example, in 3-space there are a(2)=3 (namely point onto line, point onto plane, line onto plane). - Douglas Latimer, Dec 17 2012
For n >= 1, a(n) is equal to the rank (minimal cardinality of a generating set) and idempotent rank (minimal cardinality of an idempotent generating set) of the semigroup P_n\S_n, where P_n and S_n denote the partition monoid and symmetric group on [n].
For n >= 3, a(n-1) is equal to the rank and idempotent rank of the semigroup T_n\S_n, where T_n and S_n denote the full transformation semigroup and symmetric group on [n].
(End)
For n >= 3, a(n) is equal to the rank and idempotent rank of the semigroup PT_n\S_n, where PT_n and S_n denote the partial transformation semigroup and symmetric group on [n]. - James East, Jan 15 2013
The formula, a(n)*a(n+4k+2)/2 + a(k) = a(a(n+2k+1) - (k^2+(k+1)^2)), is a generalization of the formula a(n)*a(n+2)/2 = a(a(n+1)-1) in Bergot's comment dated May 17 2012. - Charlie Marion, Mar 28 2013
For odd m = 2k+1, we have the recurrence a(m*n + k) = m^2*a(n) + a(k). Corollary: If number T is in the sequence then so is 9*T+1. - Lekraj Beedassy, May 29 2013
Euler, in Section 87 of the Opera Postuma, shows that whenever T is a triangular number then 9*T + 1, 25*T + 3, 49*T + 6 and 81*T + 10 are also triangular numbers. In general, if T is a triangular number then (2*k + 1)^2*T + k*(k + 1)/2 is also a triangular number. - Peter Bala, Jan 05 2015
Using 1/b and 1/(b+2) will give a Pythagorean triangle with sides 2*b + 2, b^2 + 2*b, and b^2 + 2*b + 2. Set b=n-1 to give a triangle with sides of lengths 2*n,n^2-1, and n^2 + 1. One-fourth the perimeter = a(n) for n > 1. - J. M. Bergot, Jul 24 2013
a(n) = A028896(n)/6, where A028896(n) = s(n) - s(n-1) are the first differences of s(n) = n^3 + 3*n^2 + 2*n - 8. s(n) can be interpreted as the sum of the 12 edge lengths plus the sum of the 6 face areas plus the volume of an n X (n-1) X (n-2) rectangular prism. - J. M. Bergot, Aug 13 2013
Number of positive roots in the root system of type A_n (for n > 0). - Tom Edgar, Nov 05 2013
A formula for the r-th successive summation of k, for k = 1 to n, is binomial(n+r,r+1) [H. W. Gould]. - Gary Detlefs, Jan 02 2014
For n >= 3, a(n-2) is the number of permutations of 1,2,...,n with the distribution of up (1) - down (0) elements 0...011 (n-3 zeros), or, the same, a(n-2) is up-down coefficient {n,3} (see comment in A060351). - Vladimir Shevelev, Feb 14 2014
a(n) is the dimension of the vector space of symmetric n X n matrices. - Derek Orr, Mar 29 2014
Non-vanishing subdiagonal of A132440^2/2, aside from the initial zero. First subdiagonal of unsigned A238363. Cf. A130534 for relations to colored forests, disposition of flags on flagpoles, and colorings of the vertices of complete graphs. - Tom Copeland, Apr 05 2014
The number of Sidon subsets of {1,...,n+1} of size 2. - Carl Najafi, Apr 27 2014
Number of factors in the definition of the Vandermonde determinant V(x_1,x_2,...,x_n) = Product_{1 <= i < k <= n} x_i - x_k. - Tom Copeland, Apr 27 2014
Number of weak compositions of n into three parts. - Robert A. Beeler, May 20 2014
Suppose a bag contains a(n) red marbles and a(n+1) blue marbles, where a(n), a(n+1) are consecutive triangular numbers. Then, for n > 0, the probability of choosing two marbles at random and getting two red or two blue is 1/2. In general, for k > 2, let b(0) = 0, b(1) = 1 and, for n > 1, b(n) = (k-1)*b(n-1) - b(n-2) + 1. Suppose, for n > 0, a bag contains b(n) red marbles and b(n+1) blue marbles. Then the probability of choosing two marbles at random and getting two red or two blue is (k-1)/(k+1). See also A027941, A061278, A089817, A053142, A092521. - Charlie Marion, Nov 03 2014
Let O(n) be the oblong number n(n+1) = A002378 and S(n) the square number n^2 = A000290(n). Then a(4n) = O(3n) - O(n), a(4n+1) = S(3n+1) - S(n), a(4n+2) = S(3n+2) - S(n+1) and a(4n+3) = O(3n+2) - O(n). - Charlie Marion, Feb 21 2015
Consider the partition of the natural numbers into parts from the set S=(1,2,3,...,n). The length (order) of the signature of the resulting sequence is given by the triangular numbers. E.g., for n=10, the signature length is 55. - David Neil McGrath, May 05 2015
a(n) counts the partitions of (n-1) unlabeled objects into three (3) parts (labeled a,b,c), e.g., a(5)=15 for (n-1)=4. These are (aaaa),(bbbb),(cccc),(aaab),(aaac),(aabb),(aacc),(aabc),(abbc),(abcc),(abbb),(accc ),(bbcc),(bccc),(bbbc). - David Neil McGrath, May 21 2015
Conjecture: the sequence is the genus/deficiency of the sinusoidal spirals of index n which are algebraic curves. The value 0 corresponds to the case of the Bernoulli Lemniscate n=2. So the formula conjectured is (n-1)(n-2)/2. - Wolfgang Tintemann, Aug 02 2015
Conjecture: Let m be any positive integer. Then, for each n = 1,2,3,... the set {Sum_{k=s..t} 1/k^m: 1 <= s <= t <= n} has cardinality a(n) = n*(n+1)/2; in other words, all the sums Sum_{k=s..t} 1/k^m with 1 <= s <= t are pairwise distinct. (I have checked this conjecture via a computer and found no counterexample.) - Zhi-Wei Sun, Sep 09 2015
The Pisano period lengths of reading the sequence modulo m seem to be A022998(m). - R. J. Mathar, Nov 29 2015
For n >= 1, a(n) is the number of compositions of n+4 into n parts avoiding the part 2. - Milan Janjic, Jan 07 2016
In this sequence only 3 is prime. - Fabian Kopp, Jan 09 2016
Suppose you are playing Bulgarian Solitaire (see A242424 and Chamberland's and Gardner's books) and, for n > 0, you are starting with a single pile of a(n) cards. Then the number of operations needed to reach the fixed state {n, n-1,...,1} is a(n-1). For example, {6}->{5,1}->{4,2}->{3,2,1}. - Charlie Marion, Jan 14 2016
Every perfect cube is the difference of the squares of two consecutive triangular numbers. 1^2-0^2 = 1^3, 3^2-1^2 = 2^3, 6^2-3^2 = 3^3. - Miquel Cerda, Jun 26 2016
For n > 1, a(n) = tau_n(k*) where tau_n(k) is the number of ordered n-factorizations of k and k* is the square of a prime. For example, tau_3(4) = tau_3(9) = tau_3(25) = tau_3(49) = 6 (see A007425) since the number of divisors of 4, 9, 25, and 49's divisors is 6, and a(3) = 6. - Melvin Peralta, Aug 29 2016
In an (n+1)-dimensional hypercube, number of two-dimensional faces congruent with a vertex (see also A001788). - Stanislav Sykora, Oct 23 2016
Generalizations of the familiar formulas, a(n) + a(n+1) = (n+1)^2 (Feb 19 2004) and a(n)^2 + a(n+1)^2 = a((n+1)^2) (Nov 22 2006), follow: a(n) + a(n+2k-1) + 4a(k-1) = (n+k)^2 + 6a(k-1) and a(n)^2 + a(n+2k-1)^2 + (4a(k-1))^2 + 3a(k-1) = a((n+k)^2 + 6a(k-1)). - Charlie Marion, Nov 27 2016
a(n) is also the greatest possible number of diagonals in a polyhedron with n+4 vertices. - Vladimir Letsko, Dec 19 2016
For n > 0, 2^5 * (binomial(n+1,2))^2 represents the first integer in a sum of 2*(2*n + 1)^2 consecutive integers that equals (2*n + 1)^6. - Patrick J. McNab, Dec 25 2016
Does not satisfy Benford's law (cf. Ross, 2012). - N. J. A. Sloane, Feb 12 2017
Number of ordered triples (a,b,c) of positive integers not larger than n such that a+b+c = 2n+1. - Aviel Livay, Feb 13 2017
Number of inequivalent tetrahedral face colorings using at most n colors so that no color appears only once. - David Nacin, Feb 22 2017
Also the Wiener index of the complete graph K_{n+1}. - Eric W. Weisstein, Sep 07 2017
Number of intersections between the Bernstein polynomials of degree n. - Eric Desbiaux, Apr 01 2018
a(n) is the area of a triangle with vertices at (1,1), (n+1,n+2), and ((n+1)^2, (n+2)^2). - Art Baker, Dec 06 2018
For n > 0, a(n) is the smallest k > 0 such that n divides numerator of (1/a(1) + 1/a(2) + ... + 1/a(n-1) + 1/k). It should be noted that 1/1 + 1/3 + 1/6 + ... + 2/(n(n+1)) = 2n/(n+1). - Thomas Ordowski, Aug 04 2019
Upper bound of the number of lines in an n-homogeneous supersolvable line arrangement (see Theorem 1.1 in Dimca). - Stefano Spezia, Oct 04 2019
For n > 0, a(n+1) is the number of lattice points on a triangular grid with side length n. - Wesley Ivan Hurt, Aug 12 2020
Maximum number of distinct nonempty substrings of a string of length n.
Maximum cardinality of the sumset A+A, where A is a set of n numbers. (End)
a(n) is the number of parking functions of size n avoiding the patterns 123, 132, and 312. - Lara Pudwell, Apr 10 2023
Suppose two rows, each consisting of n evenly spaced dots, are drawn in parallel. Suppose we bijectively draw lines between the dots of the two rows. For n >= 1, a(n - 1) is the maximal possible number of intersections between the lines. Equivalently, the maximal number of inversions in a permutation of [n]. - Sela Fried, Apr 18 2023
The following equation complements the generalization in Bala's Comment (Jan 05 2015). (2k + 1)^2*a(n) + a(k) = a((2k + 1)*n + k). - Charlie Marion, Aug 28 2023
a(n) + a(n+k) + a(k-1) + (k-1)*n = (n+k)^2. For k = 1, we have a(n) + a(n+1) = (n+1)^2. - Charlie Marion, Nov 17 2023
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
C. Alsina and R. B. Nelson, Charming Proofs: A Journey into Elegant Mathematics, MAA, 2010. See Chapter 1.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 2.
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 189.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 109ff.
Marc Chamberland, Single Digits: In Praise of Small Numbers, Chapter 3, The Number Three, p. 72, Princeton University Press, 2015.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 155.
J. M. De Koninck and A. Mercier, 1001 Problèmes en Théorie Classique des Nombres, Problème 309 pp 46-196, Ellipses, Paris, 2004
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 6.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 1.
Martin Gardner, Colossal Book of Mathematics, Chapter 34, Bulgarian Solitaire and Other Seemingly Endless Tasks, pp. 455-467, W. W. Norton & Company, 2001.
James Gleick, The Information: A History, A Theory, A Flood, Pantheon, 2011. [On page 82 mentions a table of the first 19999 triangular numbers published by E. de Joncort in 1762.]
Cay S. Horstmann, Scala for the Impatient. Upper Saddle River, New Jersey: Addison-Wesley (2012): 171.
Labos E.: On the number of RGB-colors we can distinguish. Partition Spectra. Lecture at 7th Hungarian Conference on Biometry and Biomathematics. Budapest. Jul 06 2005.
A. Messiah, Quantum Mechanics, Vol.1, North Holland, Amsterdam, 1965, p. 457.
J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954.
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).
T. Trotter, Some Identities for the Triangular Numbers, Journal of Recreational Mathematics, Spring 1973, 6(2).
D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, pp. 91-93 Penguin Books 1987.
LINKS
C. Hamberg, Triangular Numbers Are Everywhere, llinois Mathematics and Science Academy, IMSA Math Journal: a Resource Notebook for High School Mathematics (1992), pp. 7-10.
Ed Pegg, Jr., Sequence Pictures, Math Games column, Dec 08 2003 [Cached copy, with permission (pdf only)]
Michel Waldschmidt, Continued fractions, École de recherche CIMPA-Oujda, Théorie des Nombres et ses Applications, 18 - 29 mai 2015: Oujda (Maroc).
Eric Weisstein's World of Mathematics, Absolute Value, Binomial Coefficient, Composition, Distance, Golomb Ruler, Line Line Picking, Polygonal Number, Triangular Number, Trinomial Coefficient, and Wiener Index
FORMULA
E.g.f.: exp(x)*(x+x^2/2).
a(n) = a(-1-n).
a(n+1) = ((n+2)/n)*a(n), Sum_{n>=1} 1/a(n) = 2. - Jon Perry, Jul 13 2003
For n > 0, a(n) = A001109(n) - Sum_{k=0..n-1} (2*k+1)* A001652(n-1-k); e.g., 10 = 204 - (1*119 + 3*20 + 5*3 + 7*0). - Charlie Marion, Jul 18 2003
With interpolated zeros, this is n*(n+2)*(1+(-1)^n)/16. - Benoit Cloitre, Aug 19 2003
a(n+1) is the determinant of the n X n symmetric Pascal matrix M_(i, j) = binomial(i+j+1, i). - Benoit Cloitre, Aug 19 2003
a(n) = ((n+1)^3 - n^3 - 1)/6. - Xavier Acloque, Oct 24 2003
a(n) = a(n-1) + (1 + sqrt(1 + 8*a(n-1)))/2. This recursive relation is inverted when taking the negative branch of the square root, i.e., a(n) is transformed into a(n-1) rather than a(n+1). - Carl R. White, Nov 04 2003
a(n) = a(n-2) + 2*n - 1. - Paul Barry, Jul 17 2004
a(n) = sqrt(sqrt(Sum_{i=1..n} Sum_{j=1..n} (i*j)^3)) = (Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} (i*j*k)^3)^(1/6). - Alexander Adamchuk, Oct 26 2004
a(n) == 1 (mod n+2) if n is odd and a(n) == n/2+2 (mod n+2) if n is even. - Jon Perry, Dec 16 2004
a(0) = 0, a(1) = 1, a(n) = 2*a(n-1) - a(n-2) + 1. - Miklos Kristof, Mar 09 2005
a(n) = floor((2*n+1)^2/8). - Paul Barry, May 29 2006
a(n)^2 + a(n+1)^2 = a((n+1)^2) [R B Nelsen, Math Mag 70 (2) (1997), p. 130]. - R. J. Mathar, Nov 22 2006
a(n)*a(n+k)+a(n+1)*a(n+1+k) = a((n+1)*(n+1+k)). Generalizes previous formula dated Nov 22 2006 [and comments by J. M. Bergot dated May 22 2012]. - Charlie Marion, Feb 04 2011
(sqrt(8*a(n)+1)-1)/2 = n. - David W. Cantrell (DWCantrell(AT)sigmaxi.net), Feb 26 2007
A general formula for polygonal numbers is P(k,n) = (k-2)*(n-1)n/2 + n = n + (k-2)* A000217(n-1), for n >= 1, k >= 3. - Omar E. Pol, Apr 28 2008 and Mar 31 2013
If we define f(n,i,a) = Sum_{j=0..k-1} (binomial(n,k)*Stirling1(n-k,i)*Product_{j=0..k-1} (-a-j)), then a(n) = -f(n,n-1,1), for n >= 1. - Milan Janjic, Dec 20 2008
An exponential generating function for the inverse of this sequence is given by Sum_{m>=0} ((Pochhammer(1, m)*Pochhammer(1, m))*x^m/(Pochhammer(3, m)*factorial(m))) = ((2-2*x)*log(1-x)+2*x)/x^2, the n-th derivative of which has a closed form which must be evaluated by taking the limit as x->0. A000217(n+1) = (lim_{x->0} d^n/dx^n (((2-2*x)*log(1-x)+2*x)/x^2))^-1 = (lim_{x->0} (2*Gamma(n)*(-1/x)^n*(n*(x/(-1+x))^n*(-x+1+n)*LerchPhi(x/(-1+x), 1, n) + (-1+x)*(n+1)*(x/(-1+x))^n + n*(log(1-x)+log(-1/(-1+x)))*(-x+1+n))/x^2))^-1. - Stephen Crowley, Jun 28 2009
With offset 1, a(n) = floor(n^3/(n+1))/2. - Gary Detlefs, Feb 14 2010
a(n) = 4*a(floor(n/2)) + (-1)^(n+1)*floor((n+1)/2). - Bruno Berselli, May 23 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=0, a(1)=1. - Mark Dols, Aug 20 2010
a(n) + 2*a(n-1) + a(n-2) = n^2 + (n-1)^2; and
a(n) + 3*a(n-1) + 3*a(n-2) + a(n-3) = n^2 + 2*(n-1)^2 + (n-2)^2.
In general, for n >= m > 2, Sum_{k=0..m} binomial(m,m-k)*a(n-k) = Sum_{k=0..m-1} binomial(m-1,m-1-k)*(n-k)^2.
a(n) - 2*a(n-1) + a(n-2) = 1, a(n) - 3*a(n-1) + 3*a(n-2) - a(n-3) = 0 and a(n) - 4*a(n-1) + 6*a(n-2) - 4*(a-3) + a(n-4) = 0.
In general, for n >= m > 2, Sum_{k=0..m} (-1)^k*binomial(m,m-k)*a(n-k) = 0.
(End)
For n > 0, a(n) = 1/(Integral_{x=0..Pi/2} 4*(sin(x))^(2*n-1)*(cos(x))^3). - Francesco Daddi, Aug 02 2011
a(n) = -s(n+1,n), where s(n,k) are the Stirling numbers of the first kind, A048994. - Mircea Merca, May 03 2012
a(n)*a(n+1) = a(Sum_{m=1..n} A005408(m))/2, for n >= 1. For example, if n=8, then a(8)*a(9) = a(80)/2 = 1620. - Ivan N. Ianakiev, May 27 2012
G.f.: x * (1 + 3x + 6x^2 + ...) = x * Product_{j>=0} (1+x^(2^j))^3 = x * A(x) * A(x^2) * A(x^4) * ..., where A(x) = (1 + 3x + 3x^2 + x^3). - Gary W. Adamson, Jun 26 2012
G.f.: G(0) where G(k) = 1 + (2*k+3)*x/(2*k+1 - x*(k+2)*(2*k+1)/(x*(k+2) + (k+1)/G(k+1))); (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Nov 23 2012
G.f.: x + 3*x^2/(Q(0)-3*x) where Q(k) = 1 + k*(x+1) + 3*x - x*(k+1)*(k+4)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, Mar 14 2013
a(n) + a(n+1) + ... + a(n+8) + 6*n = a(3*n+15). - Charlie Marion, Mar 18 2013
a(n) + a(n+1) + ... + a(n+20) + 2*n^2 + 57*n = a(5*n+55). - Charlie Marion, Mar 18 2013
In general, a(k*n) = (2*k-1)*a(n) + a((k-1)*n-1). - Charlie Marion, Apr 20 2015
Also, a(k*n) = a(k)*a(n) + a(k-1)*a(n-1). - Robert Israel, Apr 20 2015
a(n+1) = det(binomial(i+2,j+1), 1 <= i,j <= n). - Mircea Merca, Apr 06 2013
a(n) = floor(n/2) + ceiling(n^2/2) = n - floor(n/2) + floor(n^2/2). - Wesley Ivan Hurt, Jun 15 2013
Sum_{n>=1} a(n)/n! = 3*exp(1)/2 by the e.g.f. Also see A067764 regarding ratios calculated this way for binomial coefficients in general. - Richard R. Forberg, Jul 15 2013
Sum_{n>=1} (-1)^(n+1)/a(n) = 4*log(2) - 2 = 0.7725887... . - Richard R. Forberg, Aug 11 2014
Let O(n) be the oblong number n(n+1) = A002378(n) and S(n) the square number n^2 = A000290(n). Then a(n) + a(n+2k) = O(n+k) + S(k) and a(n) + a(n+2k+1) = S(n+k+1) + O(k). - Charlie Marion, Jul 16 2015
A generalization of the Nov 22 2006 formula, a(n)^2 + a(n+1)^2 = a((n+1)^2), follows. Let T(k,n) = a(n) + k. Then for all k, T(k,n)^2 + T(k,n+1)^2 = T(k,(n+1)^2 + 2*k) - 2*k. - Charlie Marion, Dec 10 2015
a(n)^2 + a(n+1)^2 = a(a(n) + a(n+1)). Deducible from N. J. A. Sloane's a(n) + a(n+1) = (n+1)^2 and R. B. Nelson's a(n)^2 + a(n+1)^2 = a((n+1)^2). - Ben Paul Thurston, Dec 28 2015
a(n)^2 + a(n+3)^2 + 19 = a(n^2 + 4*n + 10). - Charlie Marion, Nov 23 2016
G.f.: x/(1-x)^3 = (x * r(x) * r(x^3) * r(x^9) * r(x^27) * ...), where r(x) = (1 + x + x^2)^3 = (1 + 3*x + 6*x^2 + 7*x^3 + 6*x^4 + 3*x^5 + x^6). - Gary W. Adamson, Dec 03 2016
a(n) = sum of the elements of inverse of matrix Q(n), where Q(n) has elements q_i,j = 1/(1-4*(i-j)^2). So if e = appropriately sized vector consisting of 1's, then a(n) = e'.Q(n)^-1.e. - Michael Yukish, Mar 20 2017
a(n) = Sum_{k=1..n} ((2*k-1)!!*(2*n-2*k-1)!!)/((2*k-2)!!*(2*n-2*k)!!). - Michael Yukish, Mar 20 2017
Sum_{i=0..k-1} a(n+i) = (3*k*n^2 + 3*n*k^2 + k^3 - k)/6. - Christopher Hohl, Feb 23 2019
a(n) == 0 (mod n) iff n is odd (see De Koninck reference). - Bernard Schott, Jan 10 2020
8*a(k)*a(n) + ((a(k)-1)*n + a(k))^2 = ((a(k)+1)*n + a(k))^2. This formula reduces to the well-known formula, 8*a(n) + 1 = (2*n+1)^2, when k = 1. - Charlie Marion, Jul 23 2020
a(k)*a(n) = Sum_{i = 0..k-1} (-1)^i*a((k-i)*(n-i)). - Charlie Marion, Dec 04 2020
Product_{n>=1} (1 + 1/a(n)) = cosh(sqrt(7)*Pi/2)/(2*Pi).
Product_{n>=2} (1 - 1/a(n)) = 1/3. (End)
a(n) = Sum_{k=1..2*n-1} (-1)^(k+1)*a(k)*a(2*n-k). For example, for n = 4, 1*28 - 3*21 + 6*15 - 10*10 + 15*6 - 21*3 + 28*1 = 10. - Charlie Marion, Mar 23 2022
2*a(n) = A000384(n) - n^2 + 2*n. In general, if P(k,n) = the n-th k-gonal number, then (j+1)*a(n) = P(5 + j, n) - n^2 + (j+1)*n. More generally, (j+1)*P(k,n) = P(2*k + (k-2)*(j-1),n) - n^2 + (j+1)*n. - Charlie Marion, Mar 14 2023
EXAMPLE
G.f.: x + 3*x^2 + 6*x^3 + 10*x^4 + 15*x^5 + 21*x^6 + 28*x^7 + 36*x^8 + 45*x^9 + ...
When n=3, a(3) = 4*3/2 = 6.
Example(a(4)=10): ABCD where A, B, C and D are different links in a chain or different amino acids in a peptide possible fragments: A, B, C, D, AB, ABC, ABCD, BC, BCD, CD = 10.
a(2): hollyhock leaves on the Tokugawa Mon, a(4): points in Pythagorean tetractys, a(5): object balls in eight-ball billiards. - Bradley Klee, Aug 24 2015
The a(1) = 1 through a(5) = 15 ordered triples of positive integers summing to n + 2 [Beeler, McGrath above] are the following. These compositions are ranked by A014311.
(111) (112) (113) (114) (115)
(121) (122) (123) (124)
(211) (131) (132) (133)
(212) (141) (142)
(221) (213) (151)
(311) (222) (214)
(231) (223)
(312) (232)
(321) (241)
(411) (313)
(322)
(331)
(412)
(421)
(511)
The unordered strict case is A001399(n-6), with Heinz numbers A007304.
(End)
MAPLE
istriangular:=proc(n) local t1; t1:=floor(sqrt(2*n)); if n = t1*(t1+1)/2 then return true else return false; end if; end proc; # N. J. A. Sloane, May 25 2008
ZL := [S, {S=Prod(B, B, B), B=Set(Z, 1 <= card)}, unlabeled]:
seq(combstruct[count](ZL, size=n), n=2..55); # Zerinvary Lajos, Mar 24 2007
isA000217 := proc(n)
issqr(1+8*n) ;
end proc: # R. J. Mathar, Nov 29 2015 [This is the recipe Leonhard Euler proposes in chapter VII of his "Vollständige Anleitung zur Algebra", 1765. Peter Luschny, Sep 02 2022]
MATHEMATICA
CoefficientList[Series[x / (1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jul 30 2014 *)
(* For Mathematica 10.4+ *) Table[PolygonalNumber[n], {n, 0, 53}] (* Arkadiusz Wesolowski, Aug 27 2016 *)
(* The following Mathematica program, courtesy of Steven J. Miller, is useful for testing if a sequence is Benford. To test a different sequence only one line needs to be changed. This strongly suggests that the triangular numbers are not Benford, since the second and third columns of the output disagree. - N. J. A. Sloane, Feb 12 2017 *)
fd[x_] := Floor[10^Mod[Log[10, x], 1]]
benfordtest[num_] := Module[{},
For[d = 1, d <= 9, d++, digit[d] = 0];
For[n = 1, n <= num, n++,
{
d = fd[n(n+1)/2];
If[d != 0, digit[d] = digit[d] + 1];
}];
For[d = 1, d <= 9, d++, digit[d] = 1.0 digit[d]/num];
For[d = 1, d <= 9, d++,
Print[d, " ", 100.0 digit[d], " ", 100.0 Log[10, (d + 1)/d]]];
];
benfordtest[20000]
Table[Length[Join@@Permutations/@IntegerPartitions[n, {3}]], {n, 0, 15}] (* Gus Wiseman, Oct 28 2020 *)
PROG
(PARI) A000217(n) = n * (n + 1) / 2;
(PARI) list(lim)=my(v=List(), n, t); while((t=n*n++/2)<=lim, listput(v, t)); Vec(v) \\ Charles R Greathouse IV, Jun 18 2021
(Haskell)
a000217 n = a000217_list !! n
(Scala) (1 to 53).scanLeft(0)(_ + _) // Horstmann (2012), p. 171
(Python) for n in range(0, 60): print(n*(n+1)/2, end=', ') # Stefano Spezia, Dec 06 2018
(Python) # Intended to compute the initial segment of the sequence, not
# isolated terms. If in the iteration the line "x, y = x + y + 1, y + 1"
# is replaced by "x, y = x + y + k, y + k" then the figurate numbers are obtained,
# for k = 0 (natural A001477), k = 1 (triangular), k = 2 (squares), k = 3 (pentagonal), k = 4 (hexagonal), k = 5 (heptagonal), k = 6 (octagonal), etc.
def aList():
x, y = 1, 1
yield 0
while True:
yield x
x, y = x + y + 1, y + 1
CROSSREFS
Cf. A000096, A000124, A000292, A000330, A000396, A000668, A001082, A001788, A002024, A002378, A002415, A003056 (inverse function), A004526, A006011, A007318, A008953, A008954, A010054 (characteristic function), A028347, A036666, A046092, A051942, A055998, A055999, A056000, A056115, A056119, A056121, A056126, A062717, A087475, A101859, A109613, A143320, A210569, A245031, A245300, A060544, A016754.
Cf. A002817 (doubly triangular numbers), A075528 (solutions of a(n)=a(m)/2).
Cf. A104712 (first column, starting with a(1)).
Some generalized k-gonal numbers are A001318 (k=5), this sequence (k=6), A085787 (k=7), etc.
A011782 counts compositions of any length.
A337461 counts pairwise coprime triples, with unordered version A307719.
Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).
(Formerly M1413 N0552)
+10
762
0, 1, 2, 5, 12, 29, 70, 169, 408, 985, 2378, 5741, 13860, 33461, 80782, 195025, 470832, 1136689, 2744210, 6625109, 15994428, 38613965, 93222358, 225058681, 543339720, 1311738121, 3166815962, 7645370045, 18457556052, 44560482149, 107578520350, 259717522849
COMMENTS
Sometimes also called lambda numbers.
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.
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
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.
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
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
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
Number of 132-avoiding two-stack sortable permutations.
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.
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)
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
Apart from initial terms, Pisot sequence P(2,5). See A008776 for definition of Pisot sequences. - David W. Wilson
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
(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
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
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
Related convergents (numerator/denominator):
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
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
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
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:
let a(k,0) = 1, a(k,1) = 2k; for n > 0, a(k,2n) = 2*a(k,2n-1) + a(k,2n-2)
and a(k,2n+1) = (2k)*a(k,2n) + a(k,2n-1);
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)
and b(k,2n+1) = (2k)*b(k,2n) + b(k,2n-1).
For example, the convergents to sqrt(2/1) start 1/1, 3/2, 7/5, 17/12, 41/29.
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
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
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);
for example, if k=1 and n=3, then a(1,n) = a(n+1) and
1*a(1,6)^2 - a(1,5)*a(1,7) = 1*169^2 - 70*408 = 1;
1*a(1,4)*a(1,6) - a(1,5)^2 = 1*29*169 - 70^2 = 1;
b(1,5)*b(1,7) - 1*b(1,6)^2 = 99*577 - 1*239^2 = 2;
b(1,5)^2 - 1*b(1,4)*b(1,6) = 99^2 - 1*41*239 = 2.
(End)
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
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
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
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
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
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
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
Starting (1, 2, 5, ...) = INVERTi transform of A006190: (1, 3, 10, 33, 109, ...). - Gary W. Adamson, Aug 06 2010
[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
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
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
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
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
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
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
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
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
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
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
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
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
This is a divisibility sequence (i.e., if n|m then a(n)|a(m)). - Tom Edgar, Jan 28 2015
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
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
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
Also the number of matchings in the (n-1)-centipede graph. - Eric W. Weisstein, Sep 30 2017
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
(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
Number of 2-compositions of n restricted to odd parts (and allowed zeros); see Hopkins & Ouvry reference. - Brian Hopkins, Aug 17 2020
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
Named by Lucas (1878) after the English mathematician John Pell (1611-1685). - Amiram Eldar, Oct 02 2023
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
REFERENCES
J. Austin and L. Schneider, Generalized Fibonacci sequences in Pythagorean triple preserving sequences, Fib. Q., 58:1 (2020), 340-350.
P. Bachmann, Niedere Zahlentheorie (1902, 1910), reprinted Chelsea, NY, 1968, vol. 2, p. 76.
A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, pp. 122-125, 1964.
Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 941.
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.
John Derbyshire, Prime Obsession, Joseph Henry Press, 2004, see p. 16.
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.1.
Shaun Giberson and Thomas J. Osler, Extending Theon's Ladder to Any Square Root, Problem 3858, Elementa, No. 4 1996.
R. P. Grimaldi, Ternary strings with no consecutive 0's and no consecutive 1's, Congressus Numerantium, 205 (2011), 129-149.
Thomas Koshy, Pell and Pell-Lucas Numbers with Applications, Springer, New York, 2014.
Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 43.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 224.
Manfred R. Schroeder, "Number Theory in Science and Communication", 5th ed., Springer-Verlag, 2009, p. 90.
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).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 34.
D. B. West, Combinatorial Mathematics, Cambridge, 2021, p. 62.
LINKS
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.
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.
A. F. Horadam, Pell Identities, Fib. Quart., Vol. 9, No. 3, 1971, pp. 245-252, 263.
Shirley Law, Hopf Algebra of Sashes, in FPSAC 2014, Chicago, USA; Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, 2014, 621-632.
Eric Weisstein's World of Mathematics, Matching.
FORMULA
G.f.: x/(1 - 2*x - x^2). - Simon Plouffe in his 1992 dissertation.
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
a(n) = 2*a(n-1) + a(n-2), a(0)=0, a(1)=1.
a(n) = ((1 + sqrt(2))^n - (1 - sqrt(2))^n)/(2*sqrt(2)).
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
a(n) = Sum_{i, j, k >= 0: i+j+2k = n} (i+j+k)!/(i!*j!*k!).
a(n)^2 + a(n+1)^2 = a(2n+1) (1999 Putnam examination).
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.
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
a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2k+1)*2^k. - Paul Barry, May 13 2003
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
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
Apart from initial terms, inverse binomial transform of A052955. - Paul Barry, May 23 2004
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
a(n) = F(n, 2), the n-th Fibonacci polynomial evaluated at x=2. - T. D. Noe, Jan 19 2006
Let F(n) = a(n) = Pell numbers, L(n) = A002203 = companion Pell numbers ( A002203):
For a >= b and odd b, F(a+b) + F(a-b) = L(a)*F(b).
For a >= b and even b, F(a+b) + F(a-b) = F(a)*L(b).
For a >= b and odd b, F(a+b) - F(a-b) = F(a)*L(b).
For a >= b and even b, F(a+b) - F(a-b) = L(a)*F(b).
F(n+m) + (-1)^m*F(n-m) = F(n)*L(m).
F(n+m) - (-1)^m*F(n-m) = L(n)*F(m).
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(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(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(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)
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
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
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.
See A001622 for a general formula concerning the fractional parts of powers of numbers x > 1, which satisfy x - x^(-1) = floor(x).
a(n) = round((1+sqrt(2))^n/(2*sqrt(2))) for n > 0. (End) [last formula corrected by Josh Inman, Mar 05 2024]
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
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
a(n) = 3*a(n-1) - a(n-2) - a(n-3), n > 2. - Gary Detlefs, Sep 09 2010
a(n) = 2*(a(2k-1) + a(2k))*a(n-2k) - a(n-4k).
a(n) = 2*(a(2k) + a(2k+1))*a(n-2k-1) + a(n-4k-2). (End)
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
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
(1) Expression a(n+1) via a(n): a(n+1) = a(n) + sqrt(2*a^2(n) + (-1)^n);
(2) a(n+1)^2 - a(n)*a(n+2) = (-1)^n;
(3) Sum_{k=1..n} (-1)^(k-1)/(a(k)*a(k+1)) = a(n)/a(n+1);
(4) a(n)/a(n+1) = sqrt(2) - 1 + r(n), where |r(n)| < 1/(a(n+1)*a(n+2)). (End)
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
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
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
a(k*n) = a(k)*a(k*n-k+1) + a(k-1)*a(k*n-k). - Charlie Marion, Mar 27 2014
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
a(n+1) = (1+sqrt(2))*a(n) + (1-sqrt(2))^n. - Art DuPre, Apr 04 2014
a(n+1) = (1-sqrt(2))*a(n) + (1+sqrt(2))^n. - Art DuPre, Apr 04 2014
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
a(n) = 2^(n-1)*hypergeom([1-n/2, (1-n)/2], [1-n], -1) for n >= 2. - Peter Luschny, Dec 17 2015
a(n+1) = Sum_{k=0..n} binomial(n,k)*2^floor(k/2). - Tony Foster III, May 07 2017
a(n) = exp((i*Pi*n)/2)*sinh(n*arccosh(-i))/sqrt(2). - Peter Luschny, Mar 07 2018
Some properties:
(1) a(n)^2 - a(n-2)^2 = 2*a(n-1)*(a(n) + a(n-2)) (see A005319);
(2) a(n-k)*a(n+k) = a(n)^2 + (-1)^(n+k+1)*a(k)^2;
(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;
(4) a(n) - a(n-2*k+1) = ( A077444(k) - 1)*a(n-2*k+1) + a(n-4*k+2);
(5) Sum_{k=n..n+9} a(k) = 41* A001333(n+5). (End)
a(m+r)*a(n+s) - a(m+s)*a(n+r) = -(-1)^(n+s)*a(m-n)*a(r-s).
a(n)^2 - a(n+1)*a(n-1) = (-1)^(n-1).
a(n)^2 - a(n+r)*a(n-r) = (-1)^(n-r)*a(r)^2.
a(m)*a(n+1) - a(m+1)*a(n) = (-1)^n*a(m-n).
Sum_{m>=1} arctan(2/a(2*m+1)) = arctan(1/2).
Sum_{m>=2} arctan(2/a(2*m+1)) = arctan(1/12).
In general, for n > 0,
Sum_{m>=n} arctan(2/a(2*m+1)) = arctan(1/a(2*n)). (End)
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
Sum_{n >= 1} 1/(a(2*n) + 1/a(2*n)) = 1/2.
Sum_{n >= 1} 1/(a(2*n+1) - 1/a(2*n+1)) = 1/4. Both series telescope - see A075870 and A005319.
Product_{n >= 1} ( 1 + 2/a(2*n) ) = 1 + sqrt(2).
Product_{n >= 2} ( 1 - 2/a(2*n) ) = (1/3)*(1 + sqrt(2)). (End)
Sum_{n >=1} 1/a(n) = 1.84220304982752858079237158327980838... - R. J. Mathar, Feb 05 2024
a(n) = ((3^(n+1) + 1)^(n-1) mod (9^(n+1) - 2)) mod (3^(n+1) - 1). - Joseph M. Shunia, Jun 06 2024
EXAMPLE
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 + ...
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.
The following table gives the number of compositions of n=6 with Fibonacci number of parts:
Composition, number of such compositions, number of compositions of this type:
6, 1, 8;
5+1, 2, 10;
4+2, 2, 6;
3+3, 1, 4;
4+1+1, 3, 9;
3+2+1, 6, 12;
2+2+2, 1, 1;
3+1+1+1, 4, 8;
2+2+1+1, 6, 6;
2+1+1+1+1, 5, 5;
1+1+1+1+1+1, 1, 1;
for a total of a(6)=70 compositions of n=6. (End).
MAPLE
A000129 := proc(n) option remember; if n <=1 then n; else 2*procname(n-1)+procname(n-2); fi; end;
a:= n-> (<<2|1>, <1|0>>^n)[1, 2]: seq(a(n), n=0..40); # Alois P. Heinz, Aug 01 2008
A000129 := n -> `if`(n<2, n, 2^(n-1)*hypergeom([1-n/2, (1-n)/2], [1-n], -1)):
MATHEMATICA
Expand[Table[((1 + Sqrt[2])^n - (1 - Sqrt[2])^n)/(2Sqrt[2]), {n, 0, 30}]] (* Artur Jasinski, Dec 10 2006 *)
LinearRecurrence[{2, 1}, {0, 1}, 60] (* Harvey P. Dale, Jan 04 2012 *)
a[ n_] := With[ {s = Sqrt@2}, ((1 + s)^n - (1 - s)^n) / (2 s)] // Simplify; (* Michael Somos, Jun 01 2013 *)
a[ n_] := ChebyshevU[n - 1, I] / I^(n - 1); (* Michael Somos, Oct 30 2021 *)
PROG
(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
(PARI) {a(n) = imag( (1 + quadgen( 8))^n )}; /* Michael Somos, Jun 01 2013 */
(PARI) {a(n) = if( n<0, -(-1)^n, 1) * contfracpnqn( vector( abs(n), i, 1 + (i>1))) [2, 1]}; /* Michael Somos, Jun 01 2013 */
(PARI) {a(n) = polchebyshev(n-1, 2, I) / I^(n-1)}; /* Michael Somos, Oct 30 2021 */
(Sage) [lucas_number1(n, 2, -1) for n in range(30)] # Zerinvary Lajos, Apr 22 2009
(Haskell)
a000129 n = a000129_list !! n
a000129_list = 0 : 1 : zipWith (+) a000129_list (map (2 *) $ tail a000129_list)
(Maxima)
a[0]:0$
a[1]:1$
a[n]:=2*a[n-1]+a[n-2]$
(Maxima) makelist((%i)^(n-1)*ultraspherical(n-1, 1, -%i), n, 0, 24), expand; /* Emanuele Munarini, Mar 07 2018 */
(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
(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
(Python)
from itertools import islice
def A000129_gen(): # generator of terms
a, b = 0, 1
yield from [a, b]
while True:
a, b = b, a+2*b
yield b
CROSSREFS
a(n) = A054456(n-1, 0), n>=1 (first column of triangle).
INVERT transform of Fibonacci numbers ( A000045).
The following sequences (and others) belong to the same family: A001333, A000129, A026150, A002605, A046717, A015518, A084057, A063727, A002533, A002532, A083098, A083099, A083100, A015519.
Cf. A034867, A131980, A133156, A143808, A135387, A153346, A001622, A006497, A014176 (growth power), A098316, A154325, A021083, A243399, A008555.
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).
KEYWORD
nonn,easy,core,cofr,nice,frac
Pell-Lucas numbers: numerators of continued fraction convergents to sqrt(2).
(Formerly M2665 N1064)
+10
356
1, 1, 3, 7, 17, 41, 99, 239, 577, 1393, 3363, 8119, 19601, 47321, 114243, 275807, 665857, 1607521, 3880899, 9369319, 22619537, 54608393, 131836323, 318281039, 768398401, 1855077841, 4478554083, 10812186007, 26102926097, 63018038201, 152139002499, 367296043199
COMMENTS
Number of n-step non-selfintersecting paths starting at (0,0) with steps of types (1,0), (-1,0) or (0,1) [Stanley].
Number of n steps one-sided prudent walks with east, west and north steps. - Shanzhen Gao, Apr 26 2011
Number of ternary strings of length n-1 with subwords (0,2) and (2,0) not allowed. - Olivier Gérard, Aug 28 2012
Number of symmetric 2n X 2 or (2n-1) X 2 crossword puzzle grids: all white squares are edge connected; at least 1 white square on every edge of grid; 180-degree rotational symmetry. - Erich Friedman
a(n+1) is the number of ways to put molecules on a 2 X n ladder lattice so that the molecules do not touch each other.
In other words, a(n+1) is the number of independent vertex sets and vertex covers in the n-ladder graph P_2 X P_n. - Eric W. Weisstein, Apr 04 2017
Number of (n-1) X 2 binary arrays with a path of adjacent 1's from top row to bottom row, see A359576. - R. H. Hardin, Mar 16 2002
a(2*n+1) with b(2*n+1) := A000129(2*n+1), n >= 0, give all (positive integer) solutions to Pell equation a^2 - 2*b^2 = -1.
a(2*n) with b(2*n) := A000129(2*n), n >= 1, give all (positive integer) solutions to Pell equation a^2 - 2*b^2 = +1 (see Emerson reference).
Bisection: a(2*n) = T(n,3) = A001541(n), n >= 0 and a(2*n+1) = S(2*n,2*sqrt(2)) = A002315(n), n >= 0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second kind. See A053120, resp. A049310.
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) = 2. - Herbert Kociemba, Jun 02 2004
For n > 1, a(n) corresponds to the longer side of a near right-angled isosceles triangle, one of the equal sides being A000129(n). - Lekraj Beedassy, Aug 06 2004
Exponents of terms in the series F(x,1), where F is determined by the equation F(x,y) = xy + F(x^2*y,x). - Jonathan Sondow, Dec 18 2004
Number of n-words from the alphabet A={0,1,2} which two neighbors differ by at most 1. - Fung Cheok Yin (cheokyin_restart(AT)yahoo.com.hk), Aug 30 2006
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 numerators. - Amarnath Murthy, Mar 22 2003 [Amended by Paul E. Black (paul.black(AT)nist.gov), Dec 18 2006]
The intermediate convergents to 2^(1/2) begin with 4/3, 10/7, 24/17, 58/41; essentially, numerators= A052542 and denominators here. - Clark Kimberling, Aug 26 2008
Equals right border of triangle A143966. Starting (1, 3, 7, ...) equals INVERT transform of (1, 2, 2, 2, ...) and row sums of triangle A143966. - Gary W. Adamson, Sep 06 2008
Inverse binomial transform of A006012; Hankel transform is := [1, 2, 0, 0, 0, 0, 0, 0, 0, ...]. - Philippe Deléham, Dec 04 2008
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:
let a(k,0) = 1, a(k,1) = 2k; for n>0, a(k,2n) = 2*a(k,2n-1) + a(k,2n-2) and a(k,2n+1) = (2k)*a(k,2n) + a(k,2n-1);
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) and b(k,2n+1) = (2k)*b(k,2n) + b(k,2n-1).
For example, the convergents to sqrt(2/1) start 1/1, 3/2, 7/5, 17/12, 41/29.
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
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
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);
for example, if k=1 and n=3, then b(1,n)=a(n+1) and
1*a(1,6)^2 - a(1,5)*a(1,7) = 1*169^2 - 70*408 = 1;
1*a(1,4)*a(1,6) - a(1,5)^2 = 1*29*169 - 70^2 = 1;
b(1,5)*b(1,7) - 1*b(1,6)^2 = 99*577 - 1*239^2 = 2;
b(1,5)^2 - 1*b(1,4)*b(1,6) = 99^2 - 1*41*239 = 2.
(End)
This sequence occurs in the lower bound of the order of the set of equivalent resistances of n equal resistors combined in series and in parallel ( A048211). - Sameen Ahmed Khan, Jun 28 2010
Let M = a triangle with the Fibonacci series in each column, but the leftmost column is shifted upwards one row. A001333 = lim_{n->infinity} M^n, the left-shifted vector considered as a sequence. - Gary W. Adamson, Jul 27 2010
a(n) is the number of compositions of n when there are 1 type of 1 and 2 types of other natural numbers. - Milan Janjic, Aug 13 2010
Let U be the unit-primitive matrix (see [Jeffery])
U = U_(8,2) = (0 0 1 0)
(0 1 0 1)
(1 0 2 0)
(0 2 0 1).
(End)
For n >= 1, row sums of triangle
m/k.|..0.....1.....2.....3.....4.....5.....6.....7
==================================================
.0..|..1
.1..|..1.....2
.2..|..1.....2.....4
.3..|..1.....4.....4.....8
.4..|..1.....4....12.....8....16
.5..|..1.....6....12....32....16....32
.6..|..1.....6....24....32....80....32....64
.7..|..1.....8....24....80....80...192....64...128
which is the triangle for numbers 2^k*C(m,k) with duplicated diagonals. - Vladimir Shevelev, Apr 12 2012
a(n) is also the number of ways to place k non-attacking wazirs on a 2 X n board, summed over all k >= 0 (a wazir is a leaper [0,1]). - Vaclav Kotesovec, May 08 2012
The sequences a(n) and b(n) := A000129(n) are entries of powers of the special case of the Brahmagupta Matrix - for details see Suryanarayan's paper. Further, as Suryanarayan remark, if we set A = 2*(a(n) + b(n))*b(n), B = a(n)*(a(n) + 2*b(n)), C = a(n)^2 + 2*a(n)*b(n) + 2*b(n)^2 we obtain integral solutions of the Pythagorean relation A^2 + B^2 = C^2, where A and B are consecutive integers. - Roman Witula, Jul 28 2012
Pisano period lengths: 1, 1, 8, 4, 12, 8, 6, 4, 24, 12, 24, 8, 28, 6, 24, 8, 16, 24, 40, 12, .... - R. J. Mathar, Aug 10 2012
This sequence and A000129 give the diagonal numbers described by Theon of Smyrna. - Sture Sjöstedt, Oct 20 2012
a(n) is the top left entry of the n-th power of any of the following six 3 X 3 binary matrices: [1, 1, 1; 1, 1, 1; 1, 0, 0] or [1, 1, 1; 1, 1, 0; 1, 1, 0] or [1, 1, 1; 1, 0, 1; 1, 1, 0] or [1, 1, 1; 1, 1, 0; 1, 0, 1] or [1, 1, 1; 1, 0, 1; 1, 0, 1] or [1, 1, 1; 1, 0, 0; 1, 1, 1]. - R. J. Mathar, Feb 03 2014
For n > 0, a(n+1) is the length of tau^n(1) where tau is the morphism: 1 -> 101, 0 -> 1. See Song and Wu. - Michel Marcus, Jul 21 2020
For n > 0, a(n) is the number of nonisomorphic quasitrivial semigroups with n elements, see Devillet, Marichal, Teheux. A292932 is the number of labeled quasitrivial semigroups. - Peter Jipsen, Mar 28 2021
For n >= 2, 4*a(n) is the number of ways to tile this T-shaped figure of length n-1 with two colors of squares and one color of domino; shown here is the figure of length 5 (corresponding to n=6), and it has 4*a(6) = 396 different tilings.
._
|_|_ _ _ _
|_|_|_|_|_|
|_|
(End)
12*a(n) = number of walks of length n in the cyclic Kautz digraph CK(3,4). - Miquel A. Fiol, Feb 15 2024
REFERENCES
M. R. Bacon and C. K. Cook, Some properties of Oresme numbers and convolutions ..., Fib. Q., 62:3 (2024), 233-240.
A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, pp. 122-125, 1964.
John Derbyshire, Prime Obsession, Joseph Henry Press, April 2004, see p. 16.
J. Devillet, J.‐L. Marichal, and B. Teheux, Classifications of quasitrivial semigroups, Semigroup Forum, 100 (2020), 743-764.
Maribel Díaz Noguera [Maribel Del Carmen Díaz Noguera], Rigoberto Flores, Jose L. Ramirez, and Martha Romero Rojas, Catalan identities for generalized Fibonacci polynomials, Fib. Q., 62:2 (2024), 100-111.
Kenneth Edwards and Michael A. Allen, A new combinatorial interpretation of the Fibonacci numbers squared, Part II, Fib. Q., 58:2 (2020), 169-177.
R. P. Grimaldi, Ternary strings with no consecutive 0's and no consecutive 1's, Congressus Numerantium, 205 (2011), 129-149.
A. F. Horadam, R. P. Loh, and A. G. Shannon, Divisibility properties of some Fibonacci-type sequences, pp. 55-64 of Combinatorial Mathematics VI (Armidale 1978), Lect. Notes Math. 748, 1979.
Thomas Koshy, Pell and Pell-Lucas Numbers with Applications, Springer, New York, 2014.
Kin Y. Li, Math Problem Book I, 2001, p. 24, Problem 159.
I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. 2nd ed., Wiley, NY, 1966, p. 102, Problem 10.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 224.
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, Volume 1 (1986), p. 203, Example 4.1.2.
A. Tarn, Approximations to certain square roots and the series of numbers connected therewith, Mathematical Questions and Solutions from the Educational Times, 1 (1916), 8-12.
R. C. Tilley et al., The cell growth problem for filaments, Proc. Louisiana Conf. Combinatorics, ed. R. C. Mullin et al., Baton Rouge, 1970, 310-339.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987, p. 34.
LINKS
F. Harary and R. W. Robinson, Tapeworms, Unpublished manuscript, circa 1973. (Annotated scanned copy)
Claude Soudieux, De l'infini arithmétique, Zurich, 1960. [Annotated scans of selected pages. Contains many sequences including A1333]
FORMULA
a(n) = 2a(n-1) + a(n-2);
a(n) = ((1-sqrt(2))^n + (1+sqrt(2))^n)/2.
G.f.: (1 - x) / (1 - 2*x - x^2) = 1 / (1 - x / (1 - 2*x / (1 + x))). - Simon Plouffe in his 1992 dissertation.
a(n) = (-i)^n * T(n, i), with T(n, x) Chebyshev's polynomials of the first kind A053120 and i^2 = -1.
a(n) = a(n-1) + A052542(n-1), n>1. a(n)/ A052542(n) converges to sqrt(1/2). - Mario Catalani (mario.catalani(AT)unito.it), Apr 29 2003
E.g.f.: exp(x)cosh(x*sqrt(2)). - Paul Barry, May 08 2003
a(n) = Sum_{k=0..floor(n/2)} binomial(n, 2k)2^k. - Paul Barry, May 13 2003
For n > 0, a(n)^2 - (1 + (-1)^(n))/2 = Sum_{k=0..n-1} ((2k+1)* A001653(n-1-k)); e.g., 17^2 - 1 = 288 = 1*169 + 3*29 + 5*5 + 7*1; 7^2 = 49 = 1*29 + 3*5 + 5*1. - Charlie Marion, Jul 18 2003
For another recurrence see A000129.
a(n) = upper left and lower right terms of [1,1; 2,1]^n. - Gary W. Adamson, Mar 12 2008
If p[1]=1, and 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)=det A. - Milan Janjic, Apr 29 2010
For n>=2, a(n)=F_n(2)+F_(n+1)(2), where F_n(x) is Fibonacci polynomial (cf. A049310): F_n(x) = Sum_{i=0..floor((n-1)/2)} binomial(n-i-1,i)x^(n-2*i-1). - Vladimir Shevelev, Apr 13 2012
Dirichlet g.f.: (PolyLog(s,1-sqrt(2)) + PolyLog(s,1+sqrt(2)))/2. - Ilya Gutkovskiy, Jun 26 2016
a(n) = round((1/2)*sqrt(Product_{k=1..n} 4*(1 + sin(k*Pi/n)^2))), for n>=1. - Greg Dresden, Dec 28 2021
Sum_{n>=1} 1/a(n) = 1.5766479516393275911191017828913332473... - R. J. Mathar, Feb 05 2024
EXAMPLE
Convergents are 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.
The 15 3 X 2 crossword grids, with white squares represented by an o:
ooo ooo ooo ooo ooo ooo ooo oo. o.o .oo o.. .o. ..o oo. .oo
ooo oo. o.o .oo o.. .o. ..o ooo ooo ooo ooo ooo ooo .oo oo.
G.f. = 1 + x + 3*x^2 + 7*x^3 + 17*x^4 + 41*x^5 + 99*x^6 + 239*x^7 + 577*x^8 + ...
MAPLE
A001333 := proc(n) option remember; if n=0 then 1 elif n=1 then 1 else 2*procname(n-1)+procname(n-2) fi end;
Digits := 50; A001333 := n-> round((1/2)*(1+sqrt(2))^n);
with(numtheory): cf := cfrac (sqrt(2), 1000): [seq(nthnumer(cf, i), i=0..50)];
a:= n-> (M-> M[2, 1]+M[2, 2])(<<2|1>, <1|0>>^n):
A001333List := proc(m) local A, P, n; A := [1, 1]; P := [1, 1];
for n from 1 to m - 2 do P := ListTools:-PartialSums([op(A), P[-2]]);
A := [op(A), P[-1]] od; A end: A001333List(32); # Peter Luschny, Mar 26 2022
MATHEMATICA
Insert[Table[Numerator[FromContinuedFraction[ContinuedFraction[Sqrt[2], n]]], {n, 1, 40}], 1, 1] (* Stefan Steinerberger, Apr 08 2006 *)
Table[((1 - Sqrt[2])^n + (1 + Sqrt[2])^n)/2, {n, 0, 29}] // Simplify (* Robert G. Wilson v, May 02 2006 *)
a[0] = 1; a[1] = 1; a[n_] := a[n] = 2a[n - 1] + a[n - 2]; Table[a@n, {n, 0, 29}] (* Robert G. Wilson v, May 02 2006 *)
Table[ MatrixPower[{{1, 2}, {1, 1}}, n][[1, 1]], {n, 0, 30}] (* Robert G. Wilson v, May 02 2006 *)
Join[{1}, Numerator[Convergents[Sqrt[2], 30]]] (* Harvey P. Dale, Aug 22 2011 *)
CoefficientList[Series[(-1 + x)/(-1 + 2 x + x^2), {x, 0, 20}], x] (* Eric W. Weisstein, Sep 21 2017 *)
Table[Sqrt[(ChebyshevT[n, 3] + (-1)^n)/2], {n, 0, 20}] (* Eric W. Weisstein, Apr 17 2018 *)
PROG
(PARI) {a(n) = if( n<0, (-1)^n, 1) * contfracpnqn( vector( abs(n), i, 1 + (i>1))) [1, 1]}; /* Michael Somos, Sep 02 2012 */
(PARI) {a(n) = polchebyshev(n, 1, I) / I^n}; /* Michael Somos, Sep 02 2012 */
(PARI) a(n) = real((1 + quadgen(8))^n); \\ Michel Marcus, Mar 16 2021
(PARI) { default(realprecision, 2000); for (n=0, 4000, a=contfracpnqn(vector(n, i, 1+(i>1)))[1, 1]; if (a > 10^(10^3 - 6), break); write("b001333.txt", n, " ", a); ); } \\ Harry J. Smith, Jun 12 2009
(Sage) from sage.combinat.sloane_functions import recur_gen2
it = recur_gen2(1, 1, 2, 1)
(Sage) [lucas_number2(n, 2, -1)/2 for n in range(0, 30)] # Zerinvary Lajos, Apr 30 2009
(Haskell)
a001333 n = a001333_list !! n
a001333_list = 1 : 1 : zipWith (+)
a001333_list (map (* 2) $ tail a001333_list)
(Magma) [n le 2 select 1 else 2*Self(n-1)+Self(n-2): n in [1..35]]; // Vincenzo Librandi, Nov 10 2018
(Python)
from functools import cache
@cache
def a(n): return 1 if n < 2 else 2*a(n-1) + a(n-2)
CROSSREFS
See A040000 for the continued fraction expansion of sqrt(2).
See also A078057 which is the same sequence without the initial 1.
Row sums of unsigned Chebyshev T-triangle A053120. a(n)= A054458(n, 0) (first column of convolution triangle).
The following sequences (and others) belong to the same family: A001333, A000129, A026150, A002605, A046717, A015518, A084057, A063727, A002533, A002532, A083098, A083099, A083100, A015519.
Second row of the array in A135597.
Cf. Triangle A106513 (alternating row sums).
KEYWORD
nonn,cofr,easy,core,nice,frac
Numbers k such that 2*k^2 - 1 is a square.
(Formerly M3955 N1630)
+10
204
1, 5, 29, 169, 985, 5741, 33461, 195025, 1136689, 6625109, 38613965, 225058681, 1311738121, 7645370045, 44560482149, 259717522849, 1513744654945, 8822750406821, 51422757785981, 299713796309065, 1746860020068409, 10181446324101389, 59341817924539925
COMMENTS
Consider all Pythagorean triples (X,X+1,Z) ordered by increasing Z; sequence gives Z values.
The defining equation is X^2 + (X+1)^2 = Z^2, which when doubled gives 2Z^2 = (2X+1)^2 + 1. So the sequence gives Z's such that 2Z^2 = odd square + 1 ( A069894).
(x,y) = (a(n), a(n+1)) are the solutions with x < y of x/(yz) + y/(xz) + z/(xy)=3 with z=2. - Floor van Lamoen, Nov 29 2001
Consequently the sum n^2*(2n^2 - 1) of the first n odd cubes ( A002593) is also a square. - Lekraj Beedassy, Jun 05 2002
Numbers n such that 2*n^2 = ceiling(sqrt(2)*n*floor(sqrt(2)*n)). - Benoit Cloitre, May 10 2003
Also, number of domino tilings in S_5 X P_2n. - Ralf Stephan, Mar 30 2004. Here S_5 is the star graph on 5 vertices with the edges {1,2}, {1,3}, {1,4}, {1,5}.
In general, Sum_{k=0..n} binomial(2n-k,k)j^(n-k) = (-1)^n*U(2n,i*sqrt(j)/2), i=sqrt(-1). - Paul Barry, Mar 13 2005
Define a T-circle to be a first-quadrant circle with integral radius that is 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 largest T-circle that intersects C(n-1). C(n) has radius a(n) and the coordinates of its points of intersection with C(n-1) are A001108(n) and A055997(n). Cf. A001109. - Charlie Marion, Sep 14 2005
Number of 01-avoiding words of length n on alphabet {0,1,2,3,4,5} which do not end in 0. - Tanya Khovanova, Jan 10 2007
The lower principal convergents to 2^(1/2), beginning with 1/1, 7/5, 41/29, 239/169, comprise a strictly increasing sequence; numerators = A002315 and denominators = {a(n)}. - Clark Kimberling, Aug 26 2008
Apparently Ljunggren shows that 169 is the last square term.
If (p,q) is a solution of the Diophantine equation: X^2 + (X+1)^2 = Y^2 then (p+q) or (p+q+1) are perfect squares. If (p,q) is a solution of the Diophantine equation: X^2 + (X+1)^2 = Y^2 then (p+q) or (p+q)/8 are perfect squares. If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation: X^2 + (X+1)^2 = Y^2 with p < r then s-r = p+q+1. - Mohamed Bouhamida, Aug 29 2009
If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation: X^2 + (X + 1)^2 = Y^2 with p < r then r = 3p+2q+1 and s = 4p+3q+2. - Mohamed Bouhamida, Sep 02 2009
Equals INVERT transform of A005054: (1, 4, 20, 100, 500, 2500, ...) and INVERTi transform of A122074: (1, 6, 40, 268, 1796, ...). - Gary W. Adamson, Jul 22 2010
a(n) is the number of compositions of n when there are 5 types of 1 and 4 types of other natural numbers. - Milan Janjic, Aug 13 2010
The remainder after division of a(n) by a(k) appears to belong to a periodic sequence: 1, 5, ..., a(k-1), 0, a(k)-a(k-1), ..., a(k)-1, a(k)-1, ..., a(k)-a(k-1), 0, a(k-1), ..., 5, 1. See Bouhamida's Sep 01 2009 comment. - Charlie Marion, May 02 2011
(a(n+1), 2*b(n+1)) and (a(n+2), 2*b(n+1)), n >= 0, with b(n):= A001109(n), give the (u(2*n), v(2*n)) and (u(2*n+1), v(2*n+1)) sequences, respectively, for Pythagorean triples (x,y,z), where x=|u^2-v^2|, y=2*u*v and z=u^2+v^2, with u odd and v even, which are generated from (u(0)=1, v(0)=2) by the substitution rule (u,v) -> (2*v+u,v) if u < v and (u,v) -> (u,2*u+v) if u > v. This leads to primitive triples because gcd(u,v) = 1 is respected. This corresponds to (primitive) Pythagorean triangles with |x-y|=1 (the catheti differ by one length unit). This (u,v) sequence starts with (1,2), (5,2), (5,12), (29,12), (29,70) ... - Wolfdieter Lang, Mar 06 2012
Positive values of x (or y) satisfying x^2 - 6xy + y^2 + 4 = 0. - Colin Barker, Feb 04 2014
Length of period of the continued fraction expansion of a(n)*sqrt(2) is 1, the corresponding repeating value is A077444(n). - Ralf Stephan, Feb 20 2014
Positive values of x (or y) satisfying x^2 - 34xy + y^2 + 144 = 0. - Colin Barker, Mar 04 2014
The value of the hypotenuse in each triple of the Tree of primitive Pythagorean triples (cf. Wikipedia link) starting with root (3,4,5) and recursively selecting the central branch at each triple node of the tree. - Stuart E Anderson, Feb 05 2015
Positive integers z such that z^2 is a centered square number ( A001844). - Colin Barker, Feb 12 2015
The aerated sequence (b(n)) n >= 1 = [1, 0, 5, 0, 29, 0, 169, 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 = -8, Q = 1 of the 3-parameter family of divisibility sequences found by Williams and Guy. See A100047 for the connection with Chebyshev polynomials. - Peter Bala, Mar 25 2015
A002315(n-1)/a(n) is the closest rational approximation of sqrt(2) with a denominator not larger than a(n). These rational approximations together with those obtained from the sequences A001541 and A001542 give a complete set of closest rational approximations of sqrt(2) with restricted numerator or denominator. A002315(n-1)/a(n) < sqrt(2). - A.H.M. Smeets, May 28 2017
Equivalently, numbers x such that (x-1)*x/2 + x*(x+1)/2 = y^2 + (y+1)^2. y-values are listed in A001652. Example: for x=29 and y=20, 28*29/2 + 29*30/2 = 20^2 + 21^2. - Bruno Berselli, Mar 19 2018
(a(n), a(n+1)), with a(0):= 1, give all proper positive solutions m1 = m1(n) and m2 = m2(n), with m1 < m2 and n >= 0, of the Markoff triple (m, m1, m2) (see A002559) for m = 2, i.e., m1^2 - 6*m1*m2 + m2^2 = -4. Hence the unique Markoff triple with largest value m = 2 is (1, 1, 2) (for general m from A002559 this is the famous uniqueness conjecture).
For X = m2 - m1 and Y = m2 this becomes the reduced indefinite quadratic form representation X^2 + 4*X*Y - 4*Y^2 = -4, with discriminant 32, and the only proper fundamental solution (X(0), Y(0)) = (0, 1). For all nonnegative proper (X(n), Y(n)) solutions see ( A005319(n) = a(n+1) - a(n), a(n+1)), for n >= 0. (End)
Each Pell(2*k+1) = a(k+1) number with k >= 3 appears as largest number of an ordered Markoff (Markov) triple [x, y, m] with smallest value x = 2 as [2, Pell(2*k-1), Pell(2*k+1)]. This known result follows also from all positive proper solutions of the Pell equation q^2 - 2*m^2 = -1 which are q = q(k) = A002315(k) and m = m(k) = Pell(2*k+1), for k >= 0. y = y(k) = m(k) - 2*q(k) = Pell(2*k-1), with Pell(-1) = 1. The k = 0 and 1 cases do not satisfy x=2 <= y(k) <= m(k). The numbers 1 and 5 appear also as largest Markoff triple members because they are also Fibonacci numbers, and for these triples x=1. - Wolfdieter Lang, Jul 11 2018
All of the positive integer solutions of a*b+1=x^2, a*c+1=y^2, b*c+1=z^2, x+z=2*y, 0 < a < b < c are given by a= A001542(n), b= A005319(n), c= A001542(n+1), x= A001541(n), y=a(n+1), z= A002315(n) with 0 < n. - Michael Somos, Jun 26 2022
REFERENCES
R. C. Alperin, A family of nonlinear recurrences and their linear solutions, Fib. Q., 57:4 (2019), 318-321.
A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, pp. 122-125, 1964.
W. Ljunggren, "Zur Theorie der Gleichung x^2+1=Dy^4", Avh. Norske Vid. Akad. Oslo I. 5, 27pp.
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
David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 91.
LINKS
A. Blondin-Massé, S. Brlek, S. Labbé, and M. Mendès France, Fibonacci snowflakes, Special Issue dedicated to Paulo Ribenboim, Annales des Sciences Mathématiques du Québec 35, No 2 (2011).
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.
Giuseppe Lancia and Paolo Serafini, Polyhedra. Chapter 2 of Compact Extended Linear Programming Models (2018). EURO Advanced Tutorials on Operational Research. Springer, Cham., 11.
Michel Waldschmidt, Continued fractions, Ecole de recherche CIMPA-Oujda, Théorie des Nombres et ses Applications, 18 - 29 mai 2015: Oujda (Maroc).
FORMULA
G.f.: x*(1-x)/(1-6*x+x^2).
a(n) = 6*a(n-1) - a(n-2) with a(1)=1, a(2)=5.
Can be extended backwards by a(-n+1) = a(n).
a(n+1) = S(n, 6)-S(n-1, 6), n>=0, with S(n, 6) = A001109(n+1), S(-2, 6) := -1. S(n, x)=U(n, x/2) are Chebyshev's polynomials of the second kind. Cf. triangle A049310. a(n+1) = T(2*n+1, sqrt(2))/sqrt(2), n>=0, with T(n, x) Chebyshev's polynomials of the first kind. [Offset corrected by Wolfdieter Lang, Mar 06 2012]
a(n) ~ (1/4)*sqrt(2)*(sqrt(2) + 1)^(2*n+1). - Joe Keane (jgk(AT)jgk.org), May 15 2002
a(n) = (((3 + 2*sqrt(2))^(n+1) - (3 - 2*sqrt(2))^(n+1)) - ((3 + 2*sqrt(2))^n - (3 - 2*sqrt(2))^n)) / (4*sqrt(2)). Limit_{n->infinity} a(n)/a(n-1) = 3 + 2*sqrt(2). - Gregory V. Richardson, Oct 12 2002
Let q(n, x) = Sum_{i=0..n} x^(n-i)*binomial(2*n-i, i); then q(n, 4) = a(n). - Benoit Cloitre, Nov 10 2002
For n and j >= 1, Sum_{k=0..j} a(k)*a(n) - Sum_{k=0..j-1} a(k)*a(n-1) = A001109(j+1)*a(n) - A001109(j)*a(n-1) = a(n+j); e.g., (1+5+29)*5 - (1+5)*1=169. - Charlie Marion, Jul 07 2003
For n >= k >= 0, a(n)^2 = a(n+k)*a(n-k) - A084703(k)^2; e.g., 169^2 = 5741*5 - 144.
For n > 0, a(n) ^2 - a(n-1)^2 = 4*Sum_{k=0..2*n-1} a(k) = 4* A001109(2n); e.g., 985^2 - 169^2 = 4*(1 + 5 + 29 + ... + 195025) = 4*235416.
Sum_{k=0..n} ((-1)^(n-k)*a(k)) = A079291(n+1); e.g., -1 + 5 - 29 + 169 = 144.
(End)
Sum_{k=0...n} ((2k+1)*a(n-k)) = A001333(n+1)^2 - (1 + (-1)^(n+1))/2; e.g., 1*169 + 3*29 + 5*5 + 7*1 = 288 = 17^2 - 1; 1*29 + 3*5 + 5*1 = 49 = 7^2. - Charlie Marion, Jul 18 2003
Sum_{k=0...n} a(k)*a(n) = Sum_{k=0..n} a(2k) and Sum_{k=0..n} a(k)*a(n+1) = Sum_{k=0..n} a(2k+1); e.g., (1+5+29)*29 = 1+29+985 and (1+5+29)*169 = 5+169+5741. - Charlie Marion, Sep 22 2003
For n >= 3, a_{n} = 7(a_{n-1} - a_{n-2}) + a_{n-3}, with a_1 = 1, a_2 = 5 and a_3 = 29. a(n) = ((-1+2^(1/2))/2^(3/2))*(3 - 2^(3/2))^n + ((1+2^(1/2))/2^(3/2))*(3 + 2^(3/2))^n. - Antonio Alberto Olivares, Oct 13 2003
Let a(n) = A001652(n), b(n) = A046090(n) and c(n) = this sequence. Then for k > j, c(i)*(c(k) - c(j)) = a(k+i) + ... + a(i+j+1) + a(k-i-1) + ... + a(j-i) + k - j. For n < 0, a(n) = -b(-n-1). Also a(n)*a(n+2k+1) + b(n)*b(n+2k+1) + c(n)*c(n+2k+1) = (a(n+k+1) - a(n+k))^2; a(n)*a(n+2k) + b(n)*b(n+2k) + c(n)*c(n+2k) = 2*c(n+k)^2. - Charlie Marion, Jul 01 2003
Let a(n) = A001652(n), b(n) = A046090(n) and c(n) = this sequence. Then for n > 0, a(n)*b(n)*c(n)/(a(n)+b(n)+c(n)) = Sum_{k=0..n} c(2*k+1); e.g., 20*21*29/(20+21+29) = 5+169 = 174; a(n)*b(n)*c(n)/(a(n-1)+b(n-1)+c(n-1)) = Sum_{k=0..n} c(2*k); e.g., 119*120*169/(20+21+29) = 1+29+985+33461 = 34476. - Charlie Marion, Dec 01 2003
Also solutions x > 0 of the equation floor(x*r*floor(x/r))==floor(x/r*floor(x*r)) where r=1+sqrt(2). - Benoit Cloitre, Feb 15 2004
a(n)*a(n+3) = 24 + a(n+1)*a(n+2). - Ralf Stephan, May 29 2004
For n >= k, a(n)*a(n+2*k+1) - a(n+k)*a(n+k+1) = a(k)^2-1; e.g., 29*195025-985*5741 = 840 = 29^2-1; 1*169-5*29 = 24 = 5^2-1; a(n)*a(n+2*k)-a(n+k)^2 = A001542(k)^2; e.g., 169*195025-5741^2 = 144 = 12^2; 1*29-5^2 = 4 = 2^2. - Charlie Marion Jun 02 2004
For all k, a(n) is a factor of a((2n+1)*k+n). a((2*n+1)*k+n) = a(n)*(Sum_{j=0..k-1} (-1)^j*(a((2*n+1)*(k-j)) + a((2*n+1)*(k-j)-1))+(-1)^k); e.g., 195025 = 5*(33461+5741-169-29+1); 7645370045 = 169*(6625109+1136689-1).- Charlie Marion, Jun 04 2004
a(n) = Sum_{k=0..n} binomial(n+k, 2*k)4^k. - Paul Barry, Aug 30 2004 [offset 0]
a(n) = Sum_{k=0..n} binomial(2*n+1, 2*k+1)*2^k. - Paul Barry, Sep 30 2004 [offset 0]
a(n) = (-1)^n*U(2*n, i*sqrt(4)/2) = (-1)^n*U(2*n, i), U(n, x) Chebyshev polynomial of second kind, i=sqrt(-1). - Paul Barry, Mar 13 2005 [offset 0]
a(n) = Pell(2*n+1) = Pell(n)^2 + Pell(n+1)^2. - Paul Barry, Jul 18 2005 [offset 0]
With a=3+2*sqrt(2), b=3-2*sqrt(2): a(n) = (a^((2n+1)/2)+b^((2n+1)/2))/(2*sqrt(2)). a(n) = A001109(n+1)- A001109(n). - Mario Catalani (mario.catalani(AT)unito.it), Mar 31 2003
If k is in the sequence, then the next term is floor(k*(3+2*sqrt(2))). - Lekraj Beedassy, Jul 19 2005
a(n) = Jacobi_P(n,-1/2,1/2,3)/Jacobi_P(n,-1/2,1/2,1). - Paul Barry, Feb 03 2006 [offset 0]
a(n) = Sum_{k=0..n} Sum_{j=0..n-k} C(n,j)*C(n-j,k)*Pell(n-j+1), where Pell = A000129. - Paul Barry, May 19 2006 [offset 0]
6*a(n)*a(n+1) = a(n)^2+a(n+1)^2+4; e.g., 6*5*29 = 29^2+5^2+4; 6*169*985 = 169^2+985^2+4. - Charlie Marion, Oct 07 2007
2* A001541(k)*a(n)*a(n+k) = a(n)^2+a(n+k)^2+ A001542(k)^2; e.g., 2*3*5*29 = 5^2+29^2+2^2; 2*99*29*5741 = 2*99*29*5741=29^2+5741^2+70^2. - Charlie Marion, Oct 12 2007
In general, for n >= k, a(n+k) = 2* A001541(k)*a(n)-a(n-k);
e.g., a(n+0) = 2*1*a(n)-a(n); a(n+1) = 6*a(n)-a(n-1); a(6+0) = 33461 = 2*33461-33461; a(5+1) = 33461 = 6*5741-985; a(4+2) = 33461 = 34*985-29; a(3+3) = 33461 = 198*169-1.
(End)
Given k = (sqrt(2)+1)^2 = 3+2*sqrt(2) and a(0)=1, then a(n) = a(n-1)*k-((k-1)/(k^n)). - Charles L. Hohn, Mar 06 2011
Given k = (sqrt(2)+1)^2 = 3+2*sqrt(2) and a(0)=1, then a(n) = (k^n)+(k^(-n))-a(n-1) = A003499(n) - a(n-1)). - Charles L. Hohn, Apr 04 2011
G.f.: G(0)*(1-x)/(2-6*x), where G(k) = 1 + 1/(1 - x*(8*k-9)/( x*(8*k-1) - 3/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 12 2013
Sum_{n >= 2} 1/( a(n) - 1/a(n) ) = 1/4. - Peter Bala, Mar 25 2015
a(n) = Sum_{k=0..n} binomial(n,k) * 3^(n-k) * 2^k * 2^floor(k/2). - David Pasino, Jul 09 2016
E.g.f.: (sqrt(2)*sinh(2*sqrt(2)*x) + 2*cosh(2*sqrt(2)*x))*exp(3*x)/2. - Ilya Gutkovskiy, Jul 09 2016
For n>1, a(n) is the numerator of the continued fraction [1,4,1,4,...,1,4] with (n-1) repetitions of 1,4. For the denominators see A005319. - Greg Dresden, Sep 10 2019
a(n) = round(((2+sqrt(2))*(3+2*sqrt(2))^(n-1))/4). - Paul Weisenhorn, May 23 2020
a(n+1) = Sum_{k >= n} binomial(2*k,2*n)*(1/2)^(k+1). Cf. A102591. - Peter Bala, Nov 29 2021
EXAMPLE
For k=1, 2*1^2 - 1 = 2 - 1 = 1 = 1^2.
For k=5, 2*5^2 - 1 = 50 - 1 = 49 = 7^2.
For k=29, 2*29^2 - 1 = 1682 - 1 = 1681 = 41^2.
... (End)
G.f. = x + 5*x^2 + 29*x^3 + 169*x^4 + 985*x^5 + 5741*x^6 + ... - Michael Somos, Jun 26 2022
MAPLE
a[0]:=1: a[1]:=5: 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
A001653:=-(-1+5*z)/(z**2-6*z+1); # Conjectured (correctly) by Simon Plouffe in his 1992 dissertation; gives sequence except for one of the leading 1's
MATHEMATICA
LinearRecurrence[{6, -1}, {1, 5}, 40] (* Harvey P. Dale, Jul 12 2011 *)
a[ n_] := -(-1)^n ChebyshevU[2 n - 2, I]; (* Michael Somos, Jul 22 2018 *)
Numerator[{1} ~Join~
Table[FromContinuedFraction[Flatten[Table[{1, 4}, n]]], {n, 1, 40}]]; (* Greg Dresden, Sep 10 2019 *)
PROG
(PARI) {a(n) = subst(poltchebi(n-1) + poltchebi(n), x, 3)/4}; /* Michael Somos, Nov 02 2002 */
(PARI) a(n)=([5, 2; 2, 1]^(n-1))[1, 1] \\ Lambert Klasen (lambert.klasen(AT)gmx.de), corrected by Eric Chen, Jun 14 2018
(PARI) {a(n) = -(-1)^n * polchebyshev(2*n-2, 2, I)}; /* Michael Somos, Jun 26 2022 */
(Haskell)
a001653 n = a001653_list !! n
a001653_list = 1 : 5 : zipWith (-) (map (* 6) $ tail a001653_list) a001653_list
(Magma) I:=[1, 5]; [n le 2 select I[n] else 6*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Feb 22 2014
(GAP) a:=[1, 5];; for n in [3..25] do a[n]:=6*a[n-1]-a[n-2]; od; a; # Muniru A Asiru, Mar 19 2018
CROSSREFS
Cf. similar sequences listed in A238379.
a(n)^2 is a triangular number: a(n) = 6*a(n-1) - a(n-2) with a(0)=0, a(1)=1.
(Formerly M4217 N1760)
+10
193
0, 1, 6, 35, 204, 1189, 6930, 40391, 235416, 1372105, 7997214, 46611179, 271669860, 1583407981, 9228778026, 53789260175, 313506783024, 1827251437969, 10650001844790, 62072759630771, 361786555939836, 2108646576008245, 12290092900109634, 71631910824649559, 417501372047787720
COMMENTS
For n >= 2, A001108(n) gives exactly the positive integers m such that 1,2,...,m has a perfect median. The sequence of associated perfect medians is the present sequence. Let a_1,...,a_m be an (ordered) sequence of real numbers, then a term a_k is a perfect median if Sum_{j=1..k-1} a_j = Sum_{j=k+1..m} a_j. See Puzzle 1 in MSRI Emissary, Fall 2005. - Asher Auel, Jan 12 2006
(a(n), b(n)) where b(n) = A082291(n) are the integer solutions of the equation 2*binomial(b,a) = binomial(b+2,a). - Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de); comment revised by Michael Somos, Apr 07 2003
This sequence gives the values of y in solutions of the Diophantine equation x^2 - 8y^2 = 1. It also gives the values of the product xy where (x,y) satisfies x^2 - 2y^2 = +-1, i.e., a(n) = A001333(n)* A000129(n). a(n) also gives the inradius r of primitive Pythagorean triangles having legs whose lengths are consecutive integers, with corresponding semiperimeter s = a(n+1) = { A001652(n) + A046090(n) + A001653(n)}/2 and area rs = A029549(n) = 6* A029546(n). - Lekraj Beedassy, Apr 23 2003 [edited by Jon E. Schoenfield, May 04 2014]
n such that 8*n^2 = floor(sqrt(8)*n*ceiling(sqrt(8)*n)). - Benoit Cloitre, May 10 2003
For n > 0, ratios a(n+1)/a(n) may be obtained as convergents to continued fraction expansion of 3+sqrt(8): either successive convergents of [6;-6] or odd convergents of [5;1, 4]. - Lekraj Beedassy, Sep 09 2003
a(n+1) + A053141(n) = A001108(n+1). Generating floretion: - 2'i + 2'j - 'k + i' + j' - k' + 2'ii' - 'jj' - 2'kk' + 'ij' + 'ik' + 'ji' + 'jk' - 2'kj' + 2e ("jes" series). - Creighton Dement, Dec 16 2004
Kekulé numbers for certain benzenoids (see the Cyvin-Gutman reference). - Emeric Deutsch, Jun 19 2005
Number of D steps on the line y=x in all Delannoy paths of length n (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps E=(1,0), N=(0,1) and D=(1,1)). Example: a(2)=6 because in the 13 (= A001850(2)) Delannoy paths of length 2, namely (DD), (D)NE, (D)EN, NE(D), NENE, NEEN, NDE, NNEE, EN(D), ENNE, ENEN, EDN and EENN, we have altogether six D steps on the line y=x (shown between parentheses). - Emeric Deutsch, Jul 07 2005
Define a T-circle to be a first-quadrant circle with integral radius that is 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 smallest T-circle that does not intersect C(n-1). C(n) has radius a(n+1). Cf. A001653. - Charlie Marion, Sep 14 2005
Numbers such that there is an m with t(n+m)=2t(m), where t(n) are the triangular numbers A000217. For instance, t(20)=2*t(14)=210, so 6 is in the sequence. - Floor van Lamoen, Oct 13 2005
Tested for 2 < p < 27: If and only if 2^p - 1 (the Mersenne number M(p)) is prime then M(p) divides a(2^(p-1)). - Kenneth J Ramsey, May 16 2006
If 8*n+5 and 8*n+7 are twin primes then their product divides a(4*n+3). - Kenneth J Ramsey, Jun 08 2006
If p is an odd prime, then if p == 1 or 7 (mod 8), then a((p-1)/2) == 0 (mod p) and a((p+1)/2) == 1 (mod p); if p == 3 or 5 (mod 8), then a((p-1)/2) == 1 (mod p) and a((p+1)/2) == 0 (mod p). Kenneth J Ramsey's comment about twin primes follows from this. - Robert Israel, Mar 18 2007
a(n)*(a(n+b) - a(b-2)) = (a(n+1)+1)*(a(n+b-1) - a(b-1)). This identity also applies to any series a(0) = 0 a(1) = 1 a(n) = b*a(n-1) - a(n-2). - Kenneth J Ramsey, Oct 17 2007
For n < 0, let a(n) = -a(-n). Then (a(n+j) + a(k+j)) * (a(n+b+k+j) - a(b-j-2)) = (a(n+j+1) + a(k+j+1)) * (a(n+b+k+j-1) - a(b-j-1)). - Charlie Marion, Mar 04 2011
Sequence gives y values of the Diophantine equation: 0+1+2+...+x = y^2. If (a,b) and (c,d) are two consecutive solutions of the Diophantine equation: 0+1+2+...+x = y^2 with a<c then a+b = c-d and ((d+b)^2, d^2-b^2) is a solution too. If (a,b), (c,d) and (e,f) are three consecutive solutions of the Diophantine equation 0+1+2+...+x = y^2 with a < c < e then (8*d^2, d*(f-b)) is a solution too. - Mohamed Bouhamida, Aug 29 2009
If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation: 0+1+2+...+x = y^2 with p < r then r = 3*p+4*q+1 and s = 2*p+3*q+1. - Mohamed Bouhamida, Sep 02 2009
In general, if b(0)=1, b(1)=k and for n > 1, b(n) = 6*b(n-1) - b(n-2), then
for n > 0, b(n) = a(n)*k-a(n-1); e.g.,
for k=2, when b(n) = A038725(n), 2 = 1*2 - 0, 11 = 6*2 - 1, 64 = 35*2 - 6, 373 = 204*2 - 35;
for k=3, when b(n) = A001541(n), 3 = 1*3 - 0, 17 = 6*3 - 1; 99 = 35*3 - 6; 577 = 204*3 - 35;
for k=4, when b(n) = A038723(n), 4 = 1*4 - 0, 23 = 6*4 - 1; 134 = 35*4 - 6; 781 = 204*4 - 35;
for k=5, when b(n) = A001653(n), 5 = 1*5 - 0, 29 = 6*5 - 1; 169 = 35*5 - 6; 985 = 204*5 - 35.
See a Wolfdieter Lang comment on A001653 on a sequence of (u,v) values for Pythagorean triples (x,y,z) with x=|u^2-v^2|, y=2*u*v and z=u^2+v^2, with u odd and v even, generated from (u(0)=1,v(0)=2), the triple (3,4,5), by a substitution rule given there. The present a(n) appears there as b(n). The corresponding generated triangles have catheti differing by one length unit. - Wolfdieter Lang, Mar 06 2012
a(n)*a(n+2k) + a(k)^2 and a(n)*a(n+2k+1) + a(k)*a(k+1) are triangular numbers. Generalizes description of sequence. - Charlie Marion, Dec 03 2012
a(n)*a(n+2k) + a(k)^2 is the triangular square A001110(n+k). a(n)*a(n+2k+1) + a(k)*a(k+1) is the triangular oblong A029549(n+k). - Charlie Marion, Dec 05 2012
The squares of a(n) are the result of applying triangular arithmetic to the squares, using A001333 as the "guide" on what integers to square, as follows:
For n >= 1, a(n) equals the number of 01-avoiding words of length n-1 on alphabet {0,1,...,5}. - Milan Janjic, Jan 25 2015
Panda and Rout call these "balancing numbers" and note that the period of the sequence modulo a prime p is the same as that modulo p^2 when p = 13, 31, 1546463. But these are precisely the p in A238736 such that p^2 divides A000129(p - (2/p)), where (2/p) is a Jacobi symbol. In light of the above observation by Franklin T. Adams-Watters that the present sequence is one half the bisection of the Pell numbers, i.e., a(n) = A000129(2*n)/2, it follows immediately that modulo a fixed prime p, or any power thereof, the period of a(n) is half that of A000129(n). - John Blythe Dobson, Mar 06 2015
The triangular number = square number identity Tri((T(n, 3) - 1)/2) = S(n-1, 6)^2 with Tri, T, and S given in A000217, A053120 and A049310, is the special case k = 1 of the k-family of identities Tri((T(n, 2*k+1) - 1)/2) = Tri(k)*S(n-1, 2*(2*k+1))^2, k >= 0, n >= 0, with S(-1, x) = 0. For k=2 see A108741(n) for S(n-1, 10)^2. This identity boils down to the identities S(n-1, 2*x)^2 = (T(2*n, x) - 1)/(2*(x^2-1)) and 2*T(n, x)^2 - 1 = T(2*n, x) with x = 2*k+1. - Wolfdieter Lang, Feb 01 2016
a(2)=6 is perfect. For n=2*k, k > 0, k not equal to 1, a(n) is a multiple of a(2) and since every multiple (beyond 1) of a perfect number is abundant, then a(n) is abundant. sigma(a(4)) = 504 > 408 = 2*a(4). For n=2*k+1, k > 0, a(n) mod 10 = A000012(n), so a(n) is odd. If a(n) is a prime number, it is deficient; otherwise a(n) has one or two distinct prime factors and is therefore deficient again. So for n=2k+1, k > 0, a(n) is deficient. sigma(a(5)) = 1260 < 2378 = 2*a(5). - Muniru A Asiru, Apr 14 2016
Behera & Panda call these the balancing numbers, and A001541 are the balancers. - Michel Marcus, Nov 07 2017
In general, a second-order linear recurrence with constant coefficients having a signature of (c,d) will be duplicated by a third-order recurrence having a signature of (x,c^2-c*x+d,-d*x+c*d). The formulas of Olivares and Bouhamida in the formula section which have signatures of (7,-7,1) and (5,5,-1), respectively, are specific instances of this general rule for x = 7 and x = 5. - Gary Detlefs, Jan 29 2021
Note that 6 is the largest triangular number in the sequence, because it is proved that 8 and 9 are the largest perfect powers which are consecutive (Catalan's conjecture). 0 and 1 are also in the sequence because they are also perfect powers and 0*1/2 = 0^2 and 8*9/2 = (2*3)^2. - Metin Sariyar, Jul 15 2021
REFERENCES
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) - From N. J. A. Sloane, May 30 2012
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, pp. 193, 197.
D. M. Burton, The History of Mathematics, McGraw Hill, (1991), p. 213.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 10.
P. Franklin, E. F. Beckenbach, H. S. M Coxeter, N. H. McCoy, K. Menger, and J. L. Synge, Rings And Ideals, No 8, The Carus Mathematical Monographs, The Mathematical Association of America, (1967), pp. 144-146.
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 B(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
Seyed Hassan Alavi, Ashraf Daneshkhah, and Cheryl E. Praeger, Symmetries of biplanes, arXiv:2004.04535 [math.GR], 2020. See v_n in Lemma 7.9 p. 21.
Muniru A. Asiru, All square chiliagonal numbers, International Journal of Mathematical Education in Science and Technology, Volume 47, 2016 - Issue 7.
Jeremiah Bartz, Bruce Dearden, Joel Iiams, and Julia Peterson, Powers of Two as Sums of Two Balancing Numbers, Combinatorics, Graph Theory and Computing (SEICCGTC 2021) Springer Proc. Math. Stat., Vol 448, pp. 383-392. See p. 384.
Elwyn Berlekamp and Joe P. Buhler, Puzzle Column, Emissary, MSRI Newsletter, Fall 2005. Problem 1, (6 MB).
Brian Hayes, Calculemus!, American Scientist, 96 (Sep-Oct 2008), 362-366.
FORMULA
G.f.: x / (1 - 6*x + x^2). - Simon Plouffe in his 1992 dissertation.
a(n) = S(n-1, 6) = U(n-1, 3) with U(n, x) Chebyshev's polynomials of the second kind. S(-1, x) := 0. Cf. triangle A049310 for S(n, x).
a(n) = sqrt(( A001541(n)^2-1)/8) (cf. Richardson comment).
a(n) = 3*a(n-1) + sqrt(8*a(n-1)^2+1). - R. J. Mathar, Oct 09 2000
a(n) ~ (1/8)*sqrt(2)*(sqrt(2) + 1)^(2*n). - Joe Keane (jgk(AT)jgk.org), May 15 2002
a(2*n) = a(n)* A003499(n). 4*a(n) = A005319(n). - Mario Catalani (mario.catalani(AT)unito.it), Mar 21 2003
a(k)*a(2*n+k) = a(n+k)^2 - a(n)^2; e.g., 204*7997214 = 40391^2 - 35^2. - Charlie Marion, Jan 15 2004
For j < n+1, a(k+j)*a(2*n+k-j) - Sum_{i = 0..j-1} a(2*n-(2*i+1)) = a(n+k)^2 - a(n)^2. - Charlie Marion, Jan 18 2004
a(n) = ((1+sqrt(2))^(2*n) - (1-sqrt(2))^(2*n))*sqrt(2)/8;
a(n) = Sum_{i=0..n} Sum_{j=0..n} A000129(i+j)*n!/(i!*j!*(n-i-j)!)/2. (End)
E.g.f.: exp(3*x)*sinh(2*sqrt(2)*x)/(2*sqrt(2)). - Paul Barry, Apr 21 2004
a(n) = Sum_{k=0..n} binomial(2*n, 2*k+1)*2^(k-1). - Paul Barry, Oct 01 2004
a(n) = 7*(a(n-1) - a(n-2)) + a(n-3), a(1) = 0, a(2) = 1, a(3) = 6, n > 3. Also a(n) = ( (1 + sqrt(2) )^(2*n) - (1 - sqrt(2) )^(2*n) ) / (4*sqrt(2)). - Antonio Alberto Olivares, Oct 23 2003
Define f(x,s) = s*x + sqrt((s^2-1)*x^2+1); f(0,s)=0. a(n) = f(a(n-1),3), see second formula. - Marcos Carreira, Dec 27 2006
The perfect median m(n) can be expressed in terms of the Pell numbers P() = A000129() by m(n) = P(n + 2) * (P(n + 2) + (P(n + 1)) for n >= 0. - Winston A. Richards (ugu(AT)psu.edu), Jun 11 2007
a(n) = Sum_{k=0..n-1} 4^k*binomial(n+k,2*k+1). - Paul Barry, Apr 20 2009
Product_{n >= 1} (1 + 1/a(n)) = 1 + sqrt(2).
Product_{n >= 2} (1 - 1/a(n)) = (1/3)*(1 + sqrt(2)). (End)
G.f.: G(0)*x/(2-6*x), where G(k) = 1 + 1/(1 - x*(8*k-9)/( x*(8*k-1) - 3/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 12 2013
G.f.: H(0)*x/2, where H(k) = 1 + 1/( 1 - x*(6-x)/(x*(6-x) + 1/H(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Feb 18 2014
a(n) = (a(n-1)^2 - a(n-3)^2)/a(n-2) + a(n-4) for n > 3. - Patrick J. McNab, Jul 24 2015
Dirichlet g.f.: (PolyLog(s,3+2*sqrt(2)) - PolyLog(s,3-2*sqrt(2)))/(4*sqrt(2)). - Ilya Gutkovskiy, Jun 27 2016
a(n) = (a(n-3) + a(n+3))/198.
a(n) = Sum_{i=1..n} A001653(i), n>=1.
a(n) = sinh( 2 * n * arccsch(1) ) / ( 2 * sqrt(2) ). - Federico Provvedi, Feb 01 2021
(End)
a(n) = Sum_{k = 0..n-1} (-1)^(n+k+1)*binomial(n+k, 2*k+1)*8^k. - Peter Bala, Jul 17 2023
EXAMPLE
G.f. = x + 6*x^2 + 35*x^3 + 204*x^4 + 1189*x^5 + 6930*x^6 + 40391*x^7 + ...
6 is in the sequence since 6^2 = 36 is a triangular number: 36 = 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8. - Michael B. Porter, Jul 02 2016
MAPLE
a[0]:=1: a[1]:=6: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..26); # Emeric Deutsch
with (combinat):seq(fibonacci(2*n, 2)/2, n=0..20); # Zerinvary Lajos, Apr 20 2008
MATHEMATICA
Transpose[NestList[Flatten[{Rest[#], ListCorrelate[{-1, 6}, #]}]&, {0, 1}, 30]][[1]] (* Harvey P. Dale, Mar 23 2011 *)
CoefficientList[Series[x/(1-6x+x^2), {x, 0, 30}], x] (* Harvey P. Dale, Mar 23 2011 *)
TrigExpand@Table[Sinh[2 n ArcCsch[1]]/(2 Sqrt[2]), {n, 0, 10}] (* Federico Provvedi, Feb 01 2021 *)
PROG
(PARI) {a(n) = imag((3 + quadgen(32))^n)}; /* Michael Somos, Apr 07 2003 */
(PARI) {a(n) = subst( poltchebi( abs(n+1)) - 3 * poltchebi( abs(n)), x, 3) / 8}; /* Michael Somos, Apr 07 2003 */
(PARI) {a(n) = polchebyshev( n-1, 2, 3)}; /* Michael Somos, Sep 02 2012 */
(Sage) [lucas_number1(n, 6, 1) for n in range(27)] # Zerinvary Lajos, Jun 25 2008
(Sage) [chebyshev_U(n-1, 3) for n in (0..20)] # G. C. Greubel, Dec 23 2019
(Haskell)
a001109 n = a001109_list !! n :: Integer
a001109_list = 0 : 1 : zipWith (-)
(map (* 6) $ tail a001109_list) a001109_list
(Magma) [n le 2 select n-1 else 6*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jul 25 2015
(GAP) a:=[0, 1];; for n in [3..25] do a[n]:=6*a[n-1]-a[n-2]; od; a; # Muniru A Asiru, Dec 18 2018
CROSSREFS
Chebyshev sequence U(n, m): A000027 (m=1), A001353 (m=2), this sequence (m=3), A001090 (m=4), A004189 (m=5), A004191 (m=6), A007655 (m=7), A077412 (m=8), A049660 (m=9), A075843 (m=10), A077421 (m=11), A077423 (m=12), A097309 (m=13), A097311 (m=14), A097313 (m=15), A029548 (m=16), A029547 (m=17), A144128 (m=18), A078987 (m=19), A097316 (m=33).
a(n) = 6*a(n-1) - a(n-2) + 2 with a(0) = 0, a(1) = 3.
(Formerly M3074 N1247)
+10
153
0, 3, 20, 119, 696, 4059, 23660, 137903, 803760, 4684659, 27304196, 159140519, 927538920, 5406093003, 31509019100, 183648021599, 1070379110496, 6238626641379, 36361380737780, 211929657785303, 1235216565974040, 7199369738058939, 41961001862379596, 244566641436218639
COMMENTS
Consider all Pythagorean triples (X, X+1, Z) ordered by increasing Z; sequence gives X values.
Numbers n such that triangular number t(n) (see A000217) = n(n+1)/2 is a product of two consecutive integers (cf. A097571).
Members of Diophantine pairs. Solution to a(a+1) = 2b(b+1) in natural numbers including 0; a = a(n), b = b(n) = A053141(n); The solution of a special case of a binomial problem of H. Finner and K. Strassburger (strass(AT)godot.dfi.uni-duesseldorf.de).
The index of all triangular numbers T(a(n)) for which 4T(n)+1 is a perfect square.
All Pythagorean triples {X(n), Y(n)=X(n)+1, Z(n)} with X<Y<Z, may be recursively generated through the mapping W(n) -> M*W(n), where W(n)=transpose of vector [X(n) Y(n) Z(n)] and M a 3 X 3 matrix given by [2 1 2 / 1 2 2 / 2 2 3]. - Lekraj Beedassy, Aug 14 2006
In general, if b(n) = A053141(n), then a(n)*b(n+k) = a(n+k)*b(n)+b(k); e.g., 3*84 = 119*2+14; 3*2870 = 4059*2+492; 20*2870 = 5741*14+84. - Charlie Marion, Nov 19 2007
If (p,q) is a solution of the Diophantine equation: X^2 + (X+1)^2 = Y^2 then (p+q) or (p+q+1) are perfect squares. If (p,q) is a solution of the Diophantine equation: X^2 + (X+1)^2 = Y^2 then (p+q) or (p+q)/8 are perfect squares. If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation: X^2 + (X+1)^2 = Y^2 with p<r then s-r=p+q+1. - Mohamed Bouhamida, Aug 29 2009
If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation: X^2 + (X + 1)^2 = y^2 with p<r then r=3p+2q+1 and s=4p+3q+2. - Mohamed Bouhamida, Sep 02 2009
The numbers 3* A001652 = (0, 9, 60, 357, 2088, 12177, 70980, ...) are all the nonnegative values of X such that X^2 + (X+3)^2 = Z^2 (Z is in A075841). - Bruno Berselli, Aug 26 2010
Let T(n) = n*(n+1)/2 (the n-th triangular number). For n > 0,
Set a(n)=p; a(n)+1=q; the generated triple x=p^2+pq; y=q^2+pq; k=p^2+q^2 satisfies x^2+y^2=k(x+y). - Carmine Suriano, Dec 17 2013
The arms of the triangle are found with (b(n),c(n)) for 2*b(n)*c(n) and c(n)^2 - b(n)^2. Let b(1) = 1 and c(1) = 2, then b(n) = c(n-1) and c(n) = 2*c(n-1) + b(n-1). Alternatively, b(n) = c(n-1) and c(n) equals the nearest integer to b(n)*(1+sqrt(2)). - J. M. Bergot, Oct 09 2014
Conjecture: For n>1 a(n) is the index of the first occurrence of n in sequence A123737. - Vaclav Kotesovec, Jun 02 2015
Numbers m such that Product_{k=1..m} (4*k^4+1) is a square (see A274307). - Chai Wah Wu, Jun 21 2016
Numbers m such that m^2+(m+1)^2 is a square. - César Aguilera, Aug 14 2017
For integers a and d, let P(a,d,1) = a, P(a,d,2) = a+d, and, for n>2, P(a,d,n) = 2*P(a,d,n-1) + P(a,d,n-2). Further, let p(n) = Sum_{i=1..2n} P(a,d,i). Then p(n)^2 + (p(n)+d)^2 + a^2 = P(a,d,2n+1)^2 + d^2. When a = 1 and d = 1, p(n) = a(n) and P(a,d,n) = A000129(n), the n-th Pell number. - Charlie Marion, Dec 08 2018
The terms of this sequence satisfy the Diophantine equation k^2 + (k+1)^2 = m^2, which is equivalent to (2k+1)^2 - 2*m^2 = -1. Now, with x=2k+1 and y=m, we get the Pell-Fermat equation x^2 - 2*y^2 = -1. The solutions (x,y) of this equation are respectively in A002315 and A001653. The relation k = (x-1)/2 explains Lekraj Beedassy's Nov 25 2003 formula. Thus, the corresponding numbers m = y, which express the length of the hypotenuse of these right triangles (k,k+1,m) are in A001653. - Bernard Schott, Mar 10 2019
Members of Diophantine pairs. Related to solutions of p^2 = 2q^2 + 2 in natural numbers; p = p(n) = 2*sqrt(4T(a(n))+1), q = q(n) = sqrt(8*T(a(n))+1). Note that this implies that 4*T(a(n))+1 is a perfect square (numbers of the form 8*T(n)+1 are perfect squares for all n); these T(a(n))'s are the only solutions to the given Diophantine equation. - Steven Blasberg, Mar 04 2021
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, pp. 122-125, 1964.
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).
FORMULA
G.f.: x *(3 - x) / ((1 - 6*x + x^2) * (1 - x)). - Simon Plouffe in his 1992 dissertation
a(n) = 7*a(n-1) - 7*a(n-2) + a(n-3). a_{n} = -1/2 + ((1-2^{1/2})/4)*(3 - 2^{3/2})^n + ((1+2^{1/2})/4)*(3 + 2^{3/2})^n. - Antonio Alberto Olivares, Oct 13 2003
a(n) = a(n-2) + 4*sqrt(2*(a(n-1)^2)+2*a(n-1)+1). - Pierre CAMI, Mar 30 2005
a(n) = (sinh((2*n+1)*log(1+sqrt(2)))-1)/2 = (sqrt(1+8* A029549)-1)/2. - Bill Gosper, Feb 07 2010
Let b(n) = A046090(n) and c(n) = A001653(n). Then for k>j, c(i)*(c(k) - c(j)) = a(k+i) + ... + a(i+j+1) + a(k-i-1) + ... + a(j-i) + k - j. For n<0, a(n) = -b(-n-1). Also a(n)*a(n+2*k+1) + b(n)*b(n+2*k+1) + c(n)*c(n+2*k+1) = (a(n+k+1) - a(n+k))^2; a(n)*a(n+2*k) + b(n)*b(n+2*k) + c(n)*c(n+2*k) = 2*c(n+k)^2. - Charlie Marion, Jul 01 2003
a(n+1) = 3*a(n) + sqrt(8*a(n)^2 + 8*a(n) +4) + 1, a(1)=0. - Richard Choulet, Sep 18 2007
As noted (Sep 20 2006), a(n) = 5*(a(n-1) + a(n-2)) - a(n-3) + 4. In general, for n > 2*k, a(n) = A001653(k)*(a(n-k) + a(n-k-1) + 1) - a(n-2*k-1) - 1. Also a(n) = 7*(a(n-1) - a(n-2)) + a(n-3). In general, for n > 2*k, A002378(k)*(a(n-k)-a(n-k-1)) + a(n-2*k-1). - Charlie Marion, Dec 26 2007
a(n) = ( (1 + sqrt(2))^(2*n+1) + (1-sqrt(2))^(2*n+1) - 2)/4 = ( A001333(2n+1) - 1)/2.
a(2*n+k-1) = Pell(2*n-1)*Pell(2*n+2*k) + Pell(2*n-2)*Pell(2*n+2*k+1) + A001108(k+1);
a(2*n+k) = Pell(2*n)*Pell(2*n+2*k+1) + Pell(2*n-1)*Pell(2*n+2*k+2) - A055997(k+2). (End)
E.g.f.: (1/4)*(-2*exp(x) - (sqrt(2) - 1)*exp((3-2*sqrt(2))*x) + (1 + sqrt(2))*exp((3+2*sqrt(2))*x)). - Ilya Gutkovskiy, Apr 11 2016
a(n) = ((a(n-1)+1)*(a(n-1)-3))/a(n-2) for n > 2. - Vladimir Pletser, Apr 08 2020
In general, for each k >= 0, a(n) = ((a(n-k)+a(k-1)+1)*(a(n-k)-a(k)))/a(n-2*k) for n > 2*k. - Charlie Marion, Dec 27 2020
EXAMPLE
The first few triples are (0,1,1), (3,4,5), (20,21,29), (119,120,169), ...
MAPLE
option remember;
if n <= 1 then
op(n+1, [0, 3]) ;
else
6*procname(n-1)-procname(n-2)+2 ;
end if;
MATHEMATICA
LinearRecurrence[{7, -7, 1}, {0, 3, 20}, 30] (* Harvey P. Dale, Aug 19 2011 *)
With[{c=3+2*Sqrt[2]}, NestList[Floor[c*#]+3&, 3, 30]] (* Harvey P. Dale, Oct 22 2012 *)
CoefficientList[Series[x (3 - x)/((1 - 6 x + x^2) (1 - x)), {x, 0, 30}], x] (* Vincenzo Librandi, Oct 21 2014 *)
Table[(LucasL[2*n + 1, 2] - 2)/4, {n, 0, 30}] (* G. C. Greubel, Jul 15 2018 *)
PROG
(PARI) {a(n) = subst( poltchebi(n+1) - poltchebi(n) - 2, x, 3) / 4}; /* Michael Somos, Aug 11 2006 */
(PARI) concat(0, Vec(x*(3-x)/((1-6*x+x^2)*(1-x)) + O(x^50))) \\ Altug Alkan, Nov 08 2015
(PARI) {a=1+sqrt(2); b=1-sqrt(2); Q(n) = a^n + b^n};
for(n=0, 30, print1(round((Q(2*n+1) - 2)/4), ", ")) \\ G. C. Greubel, Jul 15 2018
(Magma) Z<x>:=PolynomialRing(Integers()); N<r2>:=NumberField(x^2-2); S:=[ (-2+(r2+1)*(3+2*r2)^n-(r2-1)*(3-2*r2)^n)/4: n in [1..20] ]; [ Integers()!S[j]: j in [1..#S] ]; // Klaus Brockhaus, Feb 17 2009
(Magma) m:=30; R<x>:=PowerSeriesRing(Integers(), m); [0] cat Coefficients(R!(x*(3-x)/((1-6*x+x^2)*(1-x)))); // G. C. Greubel, Jul 15 2018
(Haskell)
a001652 n = a001652_list !! n
a001652_list = 0 : 3 : map (+ 2)
(zipWith (-) (map (* 6) (tail a001652_list)) a001652_list)
(GAP) a:=[0, 3];; for n in [3..25] do a[n]:=6*a[n-1]-a[n-2]+2; od; a; # Muniru A Asiru, Dec 08 2018
(Sage) (x*(3-x)/((1-6*x+x^2)*(1-x))).series(x, 30).coefficients(x, sparse=False) # G. C. Greubel, Mar 08 2019
CROSSREFS
Cf. A000129, A001333, A001542, A002024, A002378, A029549, A048739, A053142, A055997, A075841, A084159, A084703, A097571, A123737.
NSW numbers: a(n) = 6*a(n-1) - a(n-2); also a(n)^2 - 2*b(n)^2 = -1 with b(n) = A001653(n+1).
(Formerly M4423 N1869)
+10
123
1, 7, 41, 239, 1393, 8119, 47321, 275807, 1607521, 9369319, 54608393, 318281039, 1855077841, 10812186007, 63018038201, 367296043199, 2140758220993, 12477253282759, 72722761475561, 423859315570607, 2470433131948081, 14398739476117879, 83922003724759193
COMMENTS
Named after the Newman-Shanks-Williams reference.
For positive n, a(n) corresponds to the sum of legs of near-isosceles primitive Pythagorean triangles (with consecutive legs). - Lekraj Beedassy, Feb 06 2007
Also numbers m such that m^2 is a centered 16-gonal number; or a number of the form 8k(k+1)+1, where k = A053141(m) = {0, 2, 14, 84, 492, 2870, ...}. - Alexander Adamchuk, Apr 21 2007
The lower principal convergents to 2^(1/2), beginning with 1/1, 7/5, 41/29, 239/169, comprise a strictly increasing sequence; numerators= A002315 and denominators= A001653. - Clark Kimberling, Aug 27 2008
The upper intermediate convergents to 2^(1/2) beginning with 10/7, 58/41, 338/239, 1970/1393 form a strictly decreasing sequence; essentially, numerators= A075870, denominators= A002315. - Clark Kimberling, Aug 27 2008
General recurrence is a(n) = (a(1)-1)*a(n-1) - a(n-2), a(1) >= 4, lim_{n->oo} 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. a(1)=5 gives A001834. a(1)=6 gives A030221. a(1)=7 gives A002315. a(1)=8 gives A033890. a(1)=9 gives A057080. a(1)=10 gives A057081. - Ctibor O. Zizka, Sep 02 2008
Numbers k such that (ceiling(sqrt(k*k/2)))^2 = (1+k*k)/2. - Ctibor O. Zizka, Nov 09 2009
The values 2(a(n)^2+1) are all perfect squares, whose square root is given by A075870. - Neelesh Bodas (neelesh.bodas(AT)gmail.com), Aug 13 2010
a(n) represents all positive integers K for which 2(K^2+1) is a perfect square. - Neelesh Bodas (neelesh.bodas(AT)gmail.com), Aug 13 2010
For positive n, a(n) equals the permanent of the (2n) X (2n) tridiagonal matrix with sqrt(8)'s along the main diagonal, and i's along the superdiagonal and subdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
Remark: x^2 - 2*y^2 = +2*k^2, with positive k, and X^2 - 2*Y^2 = +2 reduce to the present Pell equation a^2 - 2*b^2 = -1 with x = k*X = 2*k*b and y = k*Y = k*a. (After a proposed solution for k = 3 by Alexander Samokrutov.) - Wolfdieter Lang, Aug 21 2015
If p is an odd prime, a((p-1)/2) == 1 (mod p). - Altug Alkan, Mar 17 2016
a(n)^2 + 1 = 2*b(n)^2, with b(n) = A001653(n), is the necessary and sufficient condition for a(n) to be a number k for which the diagonal of a 1 X k rectangle is an integer multiple of the diagonal of a 1 X 1 square. If squares are laid out thus along one diagonal of a horizontal 1 X a(n) rectangle, from the lower left corner to the upper right, the number of squares is b(n), and there will always be a square whose top corner lies exactly within the top edge of the rectangle. Numbering the squares 1 to b(n) from left to right, the number of the one square that has a corner in the top edge of the rectangle is c(n) = (2*b(n) - a(n) + 1)/2, which is A055997(n). The horizontal component of the corner of the square in the edge of the rectangle is also an integer, namely d(n) = a(n) - b(n), which is A001542(n). - David Pasino, Jun 30 2016
a(n-1)/ A001653(n) is the closest rational approximation of sqrt(2) with a numerator not larger than a(n-1). These rational approximations together with those obtained from the sequences A001541 and A001542 give a complete set of closest rational approximations of sqrt(2) with restricted numerator or denominator. a(n-1)/ A001653(n) < sqrt(2). - A.H.M. Smeets, May 28 2017
Consider the quadrant of a circle with center (0,0) bounded by the positive x and y axes. Now consider, as the start of a series, the circle contained within this quadrant which kisses both axes and the outer bounding circle. Consider further a succession of circles, each kissing the x-axis, the outer bounding circle, and the previous circle in the series. See Holmes link. The center of the n-th circle in this series is (( A001653(n)*sqrt(2)-1)/a(n-1), ( A001653(n)*sqrt(2)-1)/a(n-1)^2), the y-coordinate also being its radius. It follows that a(n-1) is the cotangent of the angle subtended at point (0,0) by the center of the n-th circle in the series with respect to the x-axis. - Graham Holmes, Aug 31 2019
There is a link between the two sequences present at the numerator and at the denominator of the fractions that give the coordinates of the center of the kissing circles. A001653 is the sequence of numbers k such that 2*k^2 - 1 is a square, and here, we have 2* A001653(n)^2 - 1 = a(n-1)^2. - Bernard Schott, Sep 02 2019
Let G be a sequence satisfying G(i) = 2*G(i-1) + G(i-2) for arbitrary integers i and without regard to the initial values of G. Then a(n) = (G(i+4*n+2) - G(i))/(2*G(i+2*n+1)) as long as G(i+2*n+1) != 0. - Klaus Purath, Mar 25 2021
All of the positive integer solutions of a*b+1=x^2, a*c+1=y^2, b*c+1=z^2, x+z=2*y, 0 < a < b < c are given by a= A001542(n), b= A005319(n), c= A001542(n+1), x= A001541(n), y= A001653(n+1), z= A002315(n) with 0 < n. - Michael Somos, Jun 26 2022
3*a(n-1) is the n-th almost Lucas-cobalancing number of second type (see Tekcan and Erdem). - Stefano Spezia, Nov 26 2022
In Moret-Blanc (1881) on page 259 some solution of m^2 - 2n^2 = -1 are listed. The values of m give this sequence, and the values of n give A001653. - Michael Somos, Oct 25 2023
For any two consecutive terms (a(n), a(n+1)) = (x,y): x^2 - 6xy + y^2 = 8 = A028884(1). In general, the following applies to all sequences (t) satisfying t(i) = 6t(i-1) - t(i-2) with t(0) = 1 and two consecutive terms (x,y): x^2 - 6xy + y^2 = A028884(t(1)-6). This includes and interprets the Feb 04 2014 comment on A001541 by Colin Barker as well as the Mar 17 2021 comment on A054489 by John O. Oladokun and the Sep 28 2008 formula on A038723 by Michael Somos. By analogy to this, for three consecutive terms (x,y,z) y^2 - xz = A028884(t(1)-6) always applies.
If (t) is a sequence satisfying t(k) = 7t(k-1) - 7t(k-2) + t(k-3) or t(k) = 6t(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 >= 0. (End)
REFERENCES
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)
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 256.
P. Ribenboim, The Book of Prime Number Records. Springer-Verlag, NY, 2nd ed., 1989, p. 288.
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.
P.-F. Teilhet, Query 2376, L'Intermédiaire des Mathématiciens, 11 (1904), 138-139. - N. J. A. Sloane, Mar 08 2022
LINKS
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.
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.
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.
Eric Weisstein's World of Mathematics, NSW Number.
FORMULA
a(n) = (1/2)*((1+sqrt(2))^(2*n+1) + (1-sqrt(2))^(2*n+1)).
a(n) = (1+sqrt(2))/2*(3+sqrt(8))^n+(1-sqrt(2))/2*(3-sqrt(8))^n. - Ralf Stephan, Feb 23 2003
a(n) = sqrt(2*( A001653(n+1))^2-1), n >= 0. [Pell equation a(n)^2 - 2*Pell(2*n+1)^2 = -1. - Wolfdieter Lang, Jul 11 2018]
G.f.: (1 + x)/(1 - 6*x + x^2). - Simon Plouffe in his 1992 dissertation
a(n) = S(n, 6)+S(n-1, 6) = S(2*n, sqrt(8)), S(n, x) = U(n, x/2) are Chebyshev's polynomials of the 2nd kind. Cf. A049310. S(n, 6)= A001109(n+1).
a(n) ~ (1/2)*(sqrt(2) + 1)^(2*n+1). - Joe Keane (jgk(AT)jgk.org), May 15 2002
Let q(n, x) = Sum_{i=0..n} x^(n-i)*binomial(2*n-i, i); then (-1)^n*q(n, -8) = a(n). - Benoit Cloitre, Nov 10 2002
With a=3+2*sqrt(2), b=3-2*sqrt(2): a(n) = (a^((2n+1)/2)-b^((2n+1)/2))/2. a(n) = A077444(n)/2. - Mario Catalani (mario.catalani(AT)unito.it), Mar 31 2003
a(n) = Sum_{k=0..n} 2^k*binomial(2*n+1, 2*k). - Zoltan Zachar (zachar(AT)fellner.sulinet.hu), Oct 08 2003
Same as: i such that sigma(i^2+1, 2) mod 2 = 1. - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 26 2004
a(n) = Jacobi_P(n,1/2,-1/2,3)/Jacobi_P(n,-1/2,1/2,1). - Paul Barry, Feb 03 2006
P_{2n}+P_{2n+1} where P_i are the Pell numbers ( A000129). Also the square root of the partial sums of Pell numbers: P_{2n}+P_{2n+1} = sqrt(Sum_{i=0..4n+1} P_i) (Santana and Diaz-Barrero, 2006). - David Eppstein, Jan 28 2007
a(n) = sqrt( A001108(2*n+1)). - Anton Vrba (antonvrba(AT)yahoo.com), Feb 14 2007
a(n+1) = 3*a(n) + sqrt(8*a(n)^2 + 8), a(1)=1. - Richard Choulet, Sep 18 2007
a(n) = third binomial transform of 1, 4, 8, 32, 64, 256, 512, ... . - Al Hakanson (hawkuu(AT)gmail.com), Aug 15 2009
a(n) = (-1)^(n-1)*(1/sqrt(-1))*cos((2*n - 1)*arcsin(sqrt(2)). - Artur Jasinski, Feb 17 2010
(a(2n) + a(2n-1))/a(n) = 2*sqrt(2)*( (1 + sqrt(2))^(4*n) - (1 - sqrt(2))^(4*n))/((1 + sqrt(2))^(2*n+1) + (1 - sqrt(2))^(2*n+1)). [This was my solution to problem 5325, School Science and Mathematics 114 (No. 8, Dec 2014).] - Henry Ricardo, Feb 05 2015
The aerated sequence (b(n))n>=1 = [1, 0, 7, 0, 41, 0, 239, 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 = -4, Q = -1 of the 3-parameter family of divisibility sequences found by Williams and Guy. See A100047.
b(n) = 1/2*((-1)^n - 1)*Pell(n) + 1/2*(1 + (-1)^(n+1))*Pell(n+1). The o.g.f. is x*(1 + x^2)/(1 - 6*x^2 + x^4).
Exp( Sum_{n >= 1} 2*b(n)*x^n/n ) = 1 + Sum_{n >= 1} 2* A026003(n-1)*x^n.
Exp( Sum_{n >= 1} (-2)*b(n)*x^n/n ) = 1 + Sum_{n >= 1} 2* A026003(n-1)*(-x)^n.
Exp( Sum_{n >= 1} 4*b(n)*x^n/n ) = 1 + Sum_{n >= 1} 4*Pell(n)*x^n.
Exp( Sum_{n >= 1} (-4)*b(n)*x^n/n ) = 1 + Sum_{n >= 1} 4*Pell(n)*(-x)^n.
Exp( Sum_{n >= 1} 8*b(n)*x^n/n ) = 1 + Sum_{n >= 1} 8* A119915(n)*x^n.
E.g.f.: (sqrt(2)*sinh(2*sqrt(2)*x) + cosh(2*sqrt(2)*x))*exp(3*x). - Ilya Gutkovskiy, Jun 30 2016
a(n) = Sum_{k=0..n} binomial(n,k) * 3^(n-k) * 2^k * 2^ceiling(k/2). - David Pasino, Jul 09 2016
a(n+1) = 3*a(n) + 4*b(n), b(n+1) = 2*a(n) + 3*b(n), with b(n)= A001653(n). - Zak Seidov, Jul 13 2017
a(n) = |Im(T(2n-1,i))|, i=sqrt(-1), T(n,x) is the Chebyshev polynomial of the first kind, Im is the imaginary part of a complex number, || is the absolute value. - Leonid Bedratyuk, Dec 17 2017
a(n+1)*a(n+2) = a(n)*a(n+3) + 48.
a(n)^2 + a(n+1)^2 = 6*a(n)*a(n+1) + 8.
a(n+1)^2 = a(n)*a(n+2) + 8.
EXAMPLE
G.f. = 1 + 7*x + 41*x^2 + 239*x^3 + 1393*x^4 + 8119*x^5 + 17321*x^6 + ... - Michael Somos, Jun 26 2022
MAPLE
option remember;
if n = 0 then
1 ;
elif n = 1 then
7;
else
6*procname(n-1)-procname(n-2) ;
end if;
a:=n->abs(Im(simplify(ChebyshevT(2*n+1, I)))):seq(a(n), n=0..20); # Leonid Bedratyuk, Dec 17 2017
# third Maple program:
a:= n-> (<<0|1>, <-1|6>>^n. <<1, 7>>)[1, 1]:
MATHEMATICA
a[0] = 1; a[1] = 7; a[n_] := a[n] = 6a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 20}] (* Robert G. Wilson v, Jun 09 2004 *)
Transpose[NestList[Flatten[{Rest[#], ListCorrelate[{-1, 6}, #]}]&, {1, 7}, 20]][[1]] (* Harvey P. Dale, Mar 23 2011 *)
LinearRecurrence[{6, -1}, {1, 7}, 20] (* Bruno Berselli, Apr 03 2018 *)
a[ n_] := -I*(-1)^n*ChebyshevT[2*n + 1, I]; (* Michael Somos, Jun 26 2022 *)
PROG
(PARI) {a(n) = subst(poltchebi(abs(n+1)) - poltchebi(abs(n)), x, 3)/2};
(PARI) {a(n) = if(n<0, -a(-1-n), polsym(x^2-2*x-1, 2*n+1)[2*n+2]/2)};
(PARI) {a(n) = my(w=3+quadgen(32)); imag((1+w)*w^n)};
(PARI) for (i=1, 10000, if(Mod(sigma(i^2+1, 2), 2)==1, print1(i, ", ")))
(PARI) {a(n) = -I*(-1)^n*polchebyshev(2*n+1, 1, I)}; /* Michael Somos, Jun 26 2022 */
(Haskell)
a002315 n = a002315_list !! n
a002315_list = 1 : 7 : zipWith (-) (map (* 6) (tail a002315_list)) a002315_list
(Magma) I:=[1, 7]; [n le 2 select I[n] else 6*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Mar 22 2015
CROSSREFS
Row sums of unsigned triangle A127675.
Cf. A053141, A075870. Cf. A000045, A002878, A004146, A026003, A100047, A119915, A192425, A088165 (prime subsequence), A057084 (binomial transform), A108051 (inverse binomial transform).
Cf. similar sequences of the type (1/k)*sinh((2*n+1)*arcsinh(k)) listed in A097775.
a(0) = 1, a(1) = 3; for n > 1, a(n) = 6*a(n-1) - a(n-2).
(Formerly M3037 N1231)
+10
116
1, 3, 17, 99, 577, 3363, 19601, 114243, 665857, 3880899, 22619537, 131836323, 768398401, 4478554083, 26102926097, 152139002499, 886731088897, 5168247530883, 30122754096401, 175568277047523, 1023286908188737, 5964153172084899, 34761632124320657
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 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
All of the positive integer solutions of a*b+1=x^2, a*c+1=y^2, b*c+1=z^2, x+z=2*y, 0<a<b<c are given by a= A001542(n), b= A005319(n), c= A001542(n+1), x= A001541(n), y= A001653(n+1), z= A002315(n) with 0<n. - Michael Somos, Jun 26 2022
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
J. M. Katri and D. R. Byrkit, Problem E1976, Amer. Math. Monthly, 75 (1968), 683-684.
FORMULA
E.g.f.: exp(3*x)*cosh(2*sqrt(2)*x). Binomial transform of A084128. - Paul Barry, May 16 2003
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) ~ (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]
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+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) = 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
Inverse binomial transform of A084130.
Sum_{n>=0} (-1)^n*a(n)/n! = cosh(2*sqrt(2))/exp(3) = 0.4226407909842764637... (End)
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
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)
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
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
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 *)
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
(Scheme, with memoization-macro definec)
(definec ( A001541 n) (cond ((zero? n) 1) ((= 1 n) 3) (else (- (* 6 ( A001541 (- n 1))) ( A001541 (- n 2))))))
CROSSREFS
Cf. A055997 = numbers n such that n(n-1)/2 is a square.
Square triangular numbers: numbers that are both triangular and square.
(Formerly M5259 N2291)
+10
83
0, 1, 36, 1225, 41616, 1413721, 48024900, 1631432881, 55420693056, 1882672131025, 63955431761796, 2172602007770041, 73804512832419600, 2507180834294496361, 85170343853180456676, 2893284510173841030625, 98286503002057414584576, 3338847817559778254844961, 113422539294030403250144100
COMMENTS
Satisfies a recurrence of S_r type for r=36: 0, 1, 36 and a(n-1)*a(n+1)=(a(n)-1)^2. First observed by Colin Dickson in alt.math.recreational, Mar 07 2004. - Rainer Rosenthal, Mar 14 2004
For every n, a(n) is the first of three triangular numbers in geometric progression. The third number in the progression is a(n+1). The middle triangular number is sqrt(a(n)*a(n+1)). Chen and Fang prove that four distinct triangular numbers are never in geometric progression. - T. D. Noe, Apr 30 2007
Conjecture: No a(2^k), where k is a nonnegative integer, can be expressed as a sum of a positive square number and a positive triangular number. - Ivan N. Ianakiev, Sep 19 2012
For n > 0, these are the triangular numbers which are the sum of two consecutive triangular numbers, for instance 36 = 15 + 21 and 1225 = 595 + 630. - Michel Marcus, Feb 18 2014
The sequence is the case P1 = 36, P2 = 68, Q = 1 of the 3-parameter family of 4th order linear divisibility sequences found by Williams and Guy. - Peter Bala, Apr 03 2014
For n=2k, k > 0, a(n) is divisible by 12 and is therefore abundant. I conjecture that for n=2k+1 a(n) is deficient [true for k up to 43 incl.]. - Ivan N. Ianakiev, Sep 30 2014
The conjecture is true for all k > 0 because: For n=2k+1, k > 0, a(n) is odd. If a(n) is a prime number, it is deficient; otherwise a(n) has one or two distinct prime factors and is therefore deficient again. So for n=2k+1, k > 0, a(n) is deficient. - Muniru A Asiru, Apr 13 2016
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 193.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923; see Vol. 2, p. 10.
Martin Gardner, Time Travel and other Mathematical Bewilderments, Freeman & Co., 1988, pp. 16-17.
Miodrag S. Petković, Famous Puzzles of Great Mathematicians, Amer. Math. Soc. (AMS), 2009, p. 64.
J. H. Silverman, A Friendly Introduction to Number Theory, Prentice Hall, 2001, p. 196.
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).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 93.
LINKS
Muniru A. Asiru, All square chiliagonal numbers, International Journal of Mathematical Education in Science and Technology, Volume 47, 2016 - Issue 7.
J. L. Pietenpol, A. V. Sylwester, E. Just, and R. M. Warten, Problem E 1473, Amer. Math. Monthly, Vol. 69, No. 2 (Feb. 1962), pp. 168-169. (From the editorial note on p. 169 of this source, we learn that the question about the existence of perfect squares in the sequence of triangular numbers cropped up in the Euler-Goldbach Briefwechsel of 1730; the translation into English of the relevant letters can be found at Correspondence of Leonhard Euler with Christian Goldbach (part II), pp. 614-615.) - José Hernández, May 24 2022
Michel Waldschmidt, Continued fractions, Ecole de recherche CIMPA-Oujda, Théorie des Nombres et ses Applications, 18 - 29 mai 2015: Oujda (Maroc).
FORMULA
a(0) = 0, a(1) = 1; for n >= 2, a(n) = 34 * a(n-1) - a(n-2) + 2.
G.f.: x*(1 + x) / (( 1 - x )*( 1 - 34*x + x^2 )).
a(n-1) * a(n+1) = (a(n)-1)^2. - Colin Dickson, posting to alt.math.recreational, Mar 07 2004
If L is a square-triangular number, then the next one is 1 + 17*L + 6*sqrt(L + 8*L^2). - Lekraj Beedassy, Jun 27 2001
a(n) - a(n-1) = A046176(n). - Sophie Kuo (ejiqj_6(AT)yahoo.com.tw), May 27 2006
a(n) = (((17+12*sqrt(2))^n) + ((17-12*sqrt(2))^n)-2)/32. - Bruce Corrigan (scentman(AT)myfamily.com), Oct 26 2002
Limit_{n->oo} a(n+1)/a(n) = 17 + 12*sqrt(2). See UWC problem link and solution. - Jaap Spies, Dec 12 2004
a(n) = 35*(a(n-1) - a(n-2)) + a(n-3);
a(n) = -1/16 + ((-24 + 17*sqrt(2))/2^(11/2))*(17 - 12*sqrt(2))^(n-1) + ((24 + 17*sqrt(2))/2^(11/2))*(17 + 12*sqrt(2))^(n-1). (End)
Closed form (as square = triangular): ( (sqrt(2)+1)^(2*n)/(4*sqrt(2)) - (1-sqrt(2))^(2*n)/(4*sqrt(2)) )^2 = (1/2) * ( ( (sqrt(2)+1)^n / 2 - (sqrt(2)-1)^n / 2 )^2 + 1 )*( (sqrt(2)+1)^n / 2 - (sqrt(2)-1)^n / 2 )^2. - Bill Gosper, Jul 25 2008
a(n) = floor((17 + 12*sqrt(2))*a(n-1)) + 3 = floor(3*sqrt(2)/4 + (17 + 12*sqrt(2))*a(n-1) + 1). - Manuel Valdivia, Aug 15 2011
a(2*n) = A001333(2*n)^2 * ( A001333(2*n)^2 - 1)/2, and a(2*n+1) = A001333(2*n+1)^2 * ( A001333(2*n+1)^2 + 1)/2. The latter is equivalent to the comment above from Ivan using A002315, which is a bisection of A001333. Using A001333 shows symmetry and helps show that a(n) are both "squares of triangular" and "triangular of squares". - Richard R. Forberg, Aug 30 2013
a(n) = (T(n,17) - 1)/16, where T(n,x) denotes the Chebyshev polynomial of the first kind.
a(n) = U(n-1,3)^2, for n >= 1, where U(n,x) denotes the Chebyshev polynomial of the second kind.
a(n) = the bottom left entry of the 2 X 2 matrix T(n, M), where M is the 2 X 2 matrix [0, -17; 1, 18].
See the remarks in A100047 for the general connection between Chebyshev polynomials of the first kind and 4th-order linear divisibility sequences. (End)
a(n) = A000129(n)^4 + Sum_{k=0..( A000129(n)^2 - ( A000129(n) mod 2))} 2*k. This formula can be proved graphically by taking the corresponding triangle of a square triangular number and cutting both acute angles, one level at a time (sum of consecutive even numbers), resulting in a square of squares (4th powers).
a(n) = A002965(2*n)^4 + Sum_{k= A002965(2*n)^2.. A002965(2*n)* A002965(2*n + 1) - 1} 2*k + 1. This formula takes an equivalent sum of consecutives, but odd numbers. (End)
E.g.f.: (exp((17-12*sqrt(2))*x) + exp((17+12*sqrt(2))*x) - 2*exp(x))/32. - Ilya Gutkovskiy, Jul 16 2016
EXAMPLE
a(2) = ((17 + 12*sqrt(2))^2 + (17 - 12*sqrt(2))^2 - 2)/32 = (289 + 24*sqrt(2) + 288 + 289 - 24*sqrt(2) + 288 - 2)/32 = (578 + 576 - 2)/32 = 1152/32 = 36 and 6^2 = 36 = 8*9/2 => a(2) is both the 6th square and the 8th triangular number.
MAPLE
a:=17+12*sqrt(2); b:=17-12*sqrt(2); A001110:=n -> expand((a^n + b^n - 2)/32); seq( A001110(n), n=0..20); # Jaap Spies, Dec 12 2004
MATHEMATICA
Table[(1/8) Round[N[Sinh[2 n ArcSinh[1]]^2, 100]], {n, 0, 20}] (* Artur Jasinski, Feb 10 2010 *)
Transpose[NestList[Flatten[{Rest[#], 34Last[#]-First[#]+2}]&, {0, 1}, 20]][[1]] (* Harvey P. Dale, Mar 25 2011 *)
LinearRecurrence[{35, -35, 1}, {0, 1, 36}, 20] (* T. D. Noe, Mar 25 2011 *)
LinearRecurrence[{6, -1}, {0, 1}, 20]^2 (* Harvey P. Dale, Oct 22 2012 *)
(* Square = Triangular = Triangular = A001110 *)
ChebyshevU[#-1, 3]^2==Binomial[ChebyshevT[#/2, 3]^2, 2]==Binomial[(1+ChebyshevT[#, 3])/2, 2]=={1, 36, 1225, 41616, 1413721}[[#]]&@Range[5]
L=0; r={}; Do[AppendTo[r, L]; L=1+17*L+6*Sqrt[L+8*L^2], {i, 1, 19}]; r (* Kebbaj Mohamed Reda, Aug 02 2023 *)
PROG
(PARI) a=vector(100); a[1]=1; a[2]=36; for(n=3, #a, a[n]=34*a[n-1]-a[n-2]+2); a \\ Charles R Greathouse IV, Jul 25 2011
(Haskell)
a001110 n = a001110_list !! n
a001110_list = 0 : 1 : (map (+ 2) $
zipWith (-) (map (* 34) (tail a001110_list)) a001110_list)
(MIT/GNU Scheme, with memoizing definec-macro from Antti Karttunen's IntSeq-library)
;; The following two are for testing whether n is in this sequence:
(define (inA001110? n) (and (zero? ( A068527 n)) (inA001109? (floor->exact (sqrt n)))))
(define (inA001109? n) (= (* 8 n n) (floor->exact (* (sqrt 8) n (ceiling->exact (* (sqrt 8) n))))))
(Magma) [n le 2 select n-1 else Floor((6*Sqrt(Self(n-1)) - Sqrt(Self(n-2)))^2): n in [1..20]]; // Vincenzo Librandi, Jul 22 2015
CROSSREFS
Cf. A240129 (triangular numbers that are squares of triangular numbers), A100047.
Search completed in 0.106 seconds
|