A046172 -id:A046172 - cp's OEIS frontend

A001079 a(n) = 10*a(n-1) - a(n-2); a(0) = 1, a(1) = 5.

1, 5, 49, 485, 4801, 47525, 470449, 4656965, 46099201, 456335045, 4517251249, 44716177445, 442644523201, 4381729054565, 43374646022449, 429364731169925, 4250272665676801, 42073361925598085, 416483346590304049

Offset: 0

N. J. A. Sloane

Also gives solutions to the equation x^2-1=floor(x*r*floor(x/r)) where r=sqrt(6). - Benoit Cloitre, Feb 14 2004
Appears to give all solutions >1 to the equation x^2=ceiling(x*r*floor(x/r)) where r=sqrt(6). - Benoit Cloitre, Feb 24 2004
a(n) and b(n) (A004189) are the nonnegative proper solutions to the Pell equation a(n)^2 - 6*(2*b(n))^2 = +1, n >= 0. The formula given below by Gregory V. Richardson follows. - Wolfdieter Lang, Jun 26 2013
a(n) are the integer square roots of (A032528 + 1). They are also the values of m where (A032528(m) - 1) has integer square roots. See A122653 for the integer square roots of (A032528 - 1), and see A122652 for the values of m where (A032528(m) + 1) has integer square roots. - Richard R. Forberg, Aug 05 2013
a(n) are also the values of m where floor(2m^2/3) has integer square roots, excluding m = 0. The corresponding integer square roots are given by A122652(n). - Richard R. Forberg, Nov 21 2013
Except for the first term, positive values of x (or y) satisfying x^2 - 10xy + y^2 + 24 = 0. - Colin Barker, Feb 09 2014
Dickson on page 384 gives the Diophantine equation "24x^2 + 1 = y^2" and later states "y_{n+1} = 10y_n - y_{n-1}" where y_n is this sequence. - Michael Somos, Jun 19 2023

			Pell equation: n = 0: 1^2 - 24*0^2 = +1, n = 1: 5^2 - 6*(1*2)^2 = 1, n = 2: 49^2 - 6*(2*10)^2 = +1. - _Wolfdieter Lang_, Jun 26 2013
G.f. = 1 + 5*x + 49*x^2 + 485*x^3 + 4801*x^4 + 47525*x^5 + 470449*x^6 + ...

Bastida, Julio R. Quadratic properties of a linearly recurrent sequence. Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1979), pp. 163-166, Congress. Numer., XXIII-XXIV, Utilitas Math., Winnipeg, Man., 1979. MR0561042 (81e:10009) - From N. J. A. Sloane, May 30 2012
L. E. Dickson, History of the Theory of Numbers, Vol. II, Diophantine Analysis. AMS Chelsea Publishing, Providence, Rhode Island, 1999, p. 384.
L. Euler, (E388) Vollstaendige Anleitung zur Algebra, Zweiter Theil, reprinted in: Opera Omnia. Teubner, Leipzig, 1911, Series (1), Vol. 1, p. 374.
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).
V. Thébault, Les Récréations Mathématiques. Gauthier-Villars, Paris, 1952, p. 281.

T. D. Noe, Table of n, a(n) for n=0..200
Hacène Belbachir, Soumeya Merwa Tebtoub, and László Németh, Ellipse Chains and Associated Sequences, J. Int. Seq., Vol. 23 (2020), Article 20.8.5.
John M. Campbell, An Integral Representation of Kekulé Numbers, and Double Integrals Related to Smarandache Sequences, arXiv preprint arXiv:1105.3399 [math.GM], 2011.
Leonhard Euler, Vollstaendige Anleitung zur Algebra, Zweiter Teil.
Leonhard Euler, De solutione problematum diophanteorum per numeros integros, par. 18.
Tanya Khovanova, Recursive Sequences
Robert Phillips, Polynomials of the form 1+4ke+4ke^2, 2008.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Index entries for linear recurrences with constant coefficients, signature (10,-1).
Index entries for sequences related to Chebyshev polynomials.

Cf. A004189, A001078, A046173, A046172, A036353, A138281, A004189.

I:=[1,5]; [n le 2 select I[n] else 10*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Sep 10 2016

A001079 := proc(n)
    option remember;
    if n <= 1 then
        op(n+1,[1,5]) ;
    else
        10*procname(n-1)-procname(n-2) ;
    end if;
end proc:
seq(A001079(n),n=0..20) ; # R. J. Mathar, Apr 30 2017

Table[(-1)^n Round[N[Cos[2 n ArcSin[Sqrt[3]]], 50]], {n, 0, 20}] (* Artur Jasinski, Oct 29 2008 *)
a[ n_] := ChebyshevT[n, 5]; (* Michael Somos, Aug 24 2014 *)
CoefficientList[Series[(1-5*x)/(1-10*x+x^2), {x, 0, 50}], x] (* G. C. Greubel, Dec 20 2017 *)
a[n_] := 3^n*Sum[(2/3)^k*Binomial[2*n, 2*k], {k,0,n}]; Flatten[Table[a[n], {n,0,18}]] (* Detlef Meya, May 21 2024 *)

{a(n) = subst(poltchebi(n), 'x, 5)}; /* Michael Somos, Sep 05 2006 */

{a(n) = real((5 + 2*quadgen(24))^n)}; /* Michael Somos, Sep 05 2006 */

{a(n) = n = abs(n); polsym(1 - 10*x + x^2, n)[n+1] / 2}; /* Michael Somos, Sep 05 2006 */

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

For all members x of the sequence, 6*x^2 -6 is a square. Limit_{n->infinity} a(n)/a(n-1) = 5 + 2*sqrt(6). - Gregory V. Richardson, Oct 13 2002
a(n) = T(n, 5) = (S(n, 10)-S(n-2, 10))/2 with S(n, x) := U(n, x/2) and T(n), resp. U(n, x), are Chebyshev's polynomials of the first, resp. second, kind. See A053120 and A049310. S(n, 10) = A004189(n+1).
a(n) = sqrt(1+24*A004189(n)^2) (cf. Richardson comment).
a(n)*a(n+3) - a(n+1)*a(n+2) = 240. - Ralf Stephan, Jun 06 2005
Chebyshev's polynomials T(n,x) evaluated at x=5.
G.f.: (1-5*x)/(1-10*x+x^2). - Simon Plouffe in his 1992 dissertation
a(n)= ((5+2*sqrt(6))^n + (5-2*sqrt(6))^n)/2.
a(-n) = a(n).
a(n+1) = 5*a(n) + 2*(6*a(n)^2-6)^(1/2) - Richard Choulet, Sep 19 2007
(sqrt(2)+sqrt(3))^(2*n)=a(n)+A001078(n)*sqrt(6). - Reinhard Zumkeller, Mar 12 2008
a(n+1) = 2*A054320(n) + 3*A138288(n). - Reinhard Zumkeller, Mar 12 2008
a(n) = cosh(2*n* arcsinh(sqrt(2))). - Herbert Kociemba, Apr 24 2008
a(n) = (-1)^n * cos(2*n* arcsin(sqrt(3))). - Artur Jasinski, Oct 29 2008
a(n) = cos(2*n* arccos(sqrt(3))). - Artur Jasinski, Sep 10 2016
a(n) = A142238(2n-1) = A041006(2n-1) = A041038(2n-1), for all n > 0. - M. F. Hasler, Feb 14 2009
2*a(n)^2 = 3*A122652(n)^2 + 2. - Charlie Marion, Feb 01 2013
E.g.f.: cosh(2*sqrt(6)*x)*exp(5*x). - Ilya Gutkovskiy, Sep 10 2016
From Peter Bala, Aug 17 2022: (Start)
a(n) = (1/2)^n * [x^n] ( 10*x + sqrt(1 + 96*x^2) )^n.
The g.f. A(x) satisfies A(2*x) = 1 + x*B'(x)/B(x), where B(x) = 1/sqrt(1 - 20*x + 4*x^2) is the g.f. of A098270.
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p >= 3 and positive integers n and k.
Sum_{n >= 1} 1/(a(n) - 3/a(n)) = 1/4.
Sum_{n >= 1} (-1)^(n+1)/(a(n) + 2/a(n)) = 1/6.
Sum_{n >= 1} 1/(a(n)^2 - 3) = 1/4 - 1/sqrt(24). (End)
a(n) = 3^n*Sum_{k=0..n} (2/3)^k*binomial(2*n, 2*k). - Detlef Meya, May 21 2024

Chebyshev comments from Wolfdieter Lang, Nov 08 2002

A072256 a(n) = 10*a(n-1) - a(n-2) for n > 1, a(0) = a(1) = 1.

Original entry on oeis.org

1, 1, 9, 89, 881, 8721, 86329, 854569, 8459361, 83739041, 828931049, 8205571449, 81226783441, 804062262961, 7959395846169, 78789896198729, 779939566141121, 7720605765212481, 76426118085983689, 756540575094624409, 7488979632860260401, 74133255753507979601, 733843577902219535609

Offset: 0

Lekraj Beedassy, Jul 08 2002

Any k in the sequence is followed by 5*k + 2*sqrt(2*(3*k^2 - 1)).
Gives solutions for x in 3*x^2 - 2*y^2 = 1. Corresponding y is given by A054320(n-1). [corrected by Jon E. Schoenfield, Jun 08 2018]
Number of 01-avoiding words of length n on alphabet {0,1,2,3,4,5,6,7,8,9} which do not end in 0. - Tanya Khovanova, Jan 10 2007
For n >= 2, a(n) equals the permanent of the (2n-2) X (2n-2) tridiagonal matrix with sqrt(8)'s along the main diagonal, and 1's along the superdiagonal and the subdiagonal. - John M. Campbell, Jul 08 2011
Except for the first term, positive values of x (or y) satisfying x^2 - 10xy + y^2 + 8 = 0. - Colin Barker, Feb 09 2014
The aerated sequence [b(n)]n>=1 = [1, 0, 9, 0, 89, 0, 881, 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 = -12, Q = 1 of the 3-parameter family of divisibility sequences found by Williams and Guy. - Peter Bala, May 12 2025

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Christian Aebi and Grant Cairns, Equable Parallelograms on the Eisenstein Lattice, arXiv:2401.08827 [math.CO], 2024. See p. 14.
Jean-Paul Allouche, Jeffrey Shallit, and Manon Stipulanti, Combinatorics on words and generating Dirichlet series of automatic sequences, arXiv:2401.13524 [math.CO], 2024.
S. J. Cyvin and I. Gutman, Kekulé structures in benzenoid hydrocarbons, Lecture Notes in Chemistry, No. 46, Springer, New York, 1988 (p. 283).
Bruno Deschamps, Sur les bonnes valeurs initiales de la suite de Lucas-Lehmer, Journal of Number Theory, Volume 130, Issue 12, December 2010, Pages 2658-2670.
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (I).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (II).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (III).
Editors, L'Intermédiaire des Mathématiciens, Query 4500: The equation x(x+1)/2 = y*(y+1)/3, L'Intermédiaire des Mathématiciens, 22 (1915), 255-260 (IV).
Alex Fink, Richard K. Guy, and Mark Krusemeyer, Partitions with parts occurring at most thrice, Contributions to Discrete Mathematics, Vol 3, No 2 (2008), pp. 76-114. See Section 13.
Tanya Khovanova, Recursive Sequences
J.-C. Novelli and J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014.
H. C. Williams and R. K. Guy, Some fourth-order linear divisibility sequences, Intl. J. Number Theory 7 (5) (2011) 1255-1277.
H. C. Williams and R. K. Guy, Some Monoapparitic Fourth Order Linear Divisibility Sequences, Integers, Volume 12A (2012) The John Selfridge Memorial Volume.
Index entries for sequences related to Chebyshev polynomials
Index entries for linear recurrences with constant coefficients, signature (10,-1).

Cf. A031138, A046172, A054320, A108299.
Row 10 of array A094954.
First differences of A004189.
Essentially the same as A138288.

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

[n le 2 select 1 else 10*Self(n-1)-Self(n-2): n in [1..25]]; // Vincenzo Librandi, Feb 10 2014

seq( simplify(ChebyshevU(n,5) -9*ChebyshevU(n-1,5)), n=0..20); # G. C. Greubel, Jan 14 2020

a[n_]:= a[n]= 10a[n-1] -a[n-2]; a[0]=a[1]=1; Table[ a[n], {n, 0, 20}]
CoefficientList[Series[(1-9x)/(1-10x+x^2), {x, 0, 30}], x] (* Vincenzo Librandi, Feb 10 2014 *)
Table[ChebyshevU[n, 5] -9*ChebyshevU[n-1, 5], {n,0,20}] (* G. C. Greubel, Jan 14 2020 *)
LinearRecurrence[{10,-1},{1,1},20] (* Harvey P. Dale, Jun 17 2022 *)

a(n)=([0,1; -1,10]^n*[1;1])[1,1] \\ Charles R Greathouse IV, May 10 2016

vector(21, n, polchebyshev(n-1,2,5) -9*polchebyshev(n-2,2,5) ) \\ G. C. Greubel, Jan 14 2020

a(n) = (3-sqrt(6))/6 * (5+2*sqrt(6))^n + (3+sqrt(6))/6 * (5-2*sqrt(6))^n.
a(n) = (2*A031138(n) + 1)/3 = sqrt((2*A054320(n-1)^2 + 1)/3), n >= 1.
a(n) = U(n-1, 5)-U(n-2, 5) = T(2*n-1, sqrt(3))/sqrt(3) with Chebyshev's U- and T- polynomials and U(-1, x) := 0, U(-2, x) := -1, T(-1, x) := x.
G.f.: (1-9*x)/(1-10*x+x^2).
6*a(n)^2 - 2 is a square. Limit_{n->oo} a(n)/a(n-1) = 5 + 2*sqrt(6). - Gregory V. Richardson, Oct 10 2002
Let q(n, x) = Sum_{i=0..n} x^(n-i)*binomial(2*n-i, i); then q(n, 8) = a(n+1). - Benoit Cloitre, Nov 10 2002
a(n)*a(n+3) = 80 + a(n+1)*a(n+2). - Ralf Stephan, May 29 2004
a(n) = L(n-1,10), where L is defined as in A108299; see also A054320 for L(n,-10). - Reinhard Zumkeller, Jun 01 2005
a(n) = A138288(n-1) for n > 0. - Reinhard Zumkeller, Mar 12 2008
a(n) = sqrt(A046172(n)). - Paul Weisenhorn, May 15 2009
a(n) = ceiling(((3-sqrt(6))*(5+2*sqrt(6))^n)/6). - Paul Weisenhorn, May 23 2020
E.g.f.: exp(5*x)*(3*cosh(2*sqrt(6)*x) - sqrt(6)*sinh(2*sqrt(6)*x))/3. - Stefano Spezia, Oct 25 2023
From Peter Bala, May 08 2025: (Start)
a(n) = (-1)^n * Dir(n-1, -5), where Dir(n, x) denotes the n-th row polynomial of A244419.
For arbitrary x, a(n+x)^2 - 10*a(n+x)*a(n+x+1) + a(n+x+1)^2 = -8 with a(n) := (3-sqrt(6))/6 * (5+2*sqrt(6))^n + (3+sqrt(6))/6 * (5-2*sqrt(6))^n as given above (the particular case x = 0 is noted in the Comments section).
a(n+1/2) = 1/sqrt(3) * A001079(n).
a(n+3/4) + a(n+1/4) = sqrt(2/3) * sqrt(1 + sqrt(3)) * A001079(n).
a(n+3/4) - a(n+1/4) = 4 * sqrt(sqrt(3) - 1) * A004189(n).
a(n) divides a(3*n-1); a(n) divides a(5*n-2); in general, for k >= 0, a(n) divides a((2*k+1)*n - k).
Sum_{n >= 2} 1/(a(n) - 1/a(n)) = 1/8 (telescoping series: for n >= 2, 1/(a(n) - 1/a(n)) = 1/A291181(n-2) - 1/A291181(n-1).)
Product_{n >= 2} ((a(n) + 1)/(a(n) - 1))^(-1)^n = sqrt(3/2) (telescoping product: Product_{n = 2..k} (((a(n) + 1)/(a(n) - 1))^(-1)^n)^2 = 3/2 * (1 - (-1)^(k+1)/(3*A098308(k))).) (End)

Edited by Robert G. Wilson v, Jul 17 2002

A036353 Square pentagonal numbers.

Original entry on oeis.org

0, 1, 9801, 94109401, 903638458801, 8676736387298001, 83314021887196947001, 799981229484128697805801, 7681419682192581869134354401, 73756990988431941623299373152801, 708214619789503821274338711878841001, 6800276705461824703444258688161258139001

Offset: 0

Jean-Francois Chariot (jeanfrancois.chariot(AT)afoc.alcatel.fr)

Lim_{n -> oo} a(n)/a(n-1) = (sqrt(2) + sqrt(3))^8 = 4801 + 1960*sqrt(6). - Ant King, Nov 06 2011

Pentagonal numbers (A000326) which are also centered octagonal numbers (A016754). - Colin Barker, Jan 11 2015

Colin Barker, Table of n, a(n) for n = 0..252
Muniru A. Asiru, All square chiliagonal numbers, International Journal of Mathematical Education in Science and Technology, Volume 47, 2016 - Issue 7.
Byungchan Kim, Eunmi Kim, and Jeremy Lovejoy, On weighted overpartitions related to some q-series in Ramanujan's lost notebook, Int'l J. Number Theory (2021). Also at Université de Paris (France, 2020).
Eric Weisstein's World of Mathematics, Pentagonal Square Number
Index entries for linear recurrences with constant coefficients, signature (9603,-9603,1).

Cf. A000326, A001078, A001079, A001110, A046172, A046173, A248205.

Table[Floor[1/96 ( Sqrt[2] + Sqrt[3] ) ^ ( 8*n - 4 ) ] , {n, 0, 9}] (* Ant King, Nov 06 2011 *)
LinearRecurrence[{9603,-9603,1},{0,1,9801,94109401},20] (* Harvey P. Dale, Apr 14 2019 *)

for(n=0,10^9,g=(n*(3*n-1)/2); if(issquare(g),print(g)))

concat(0, Vec(x*(1+198*x+x^2)/((1-x)*(1-9602*x+x^2)) + O(x^20))) \\ Colin Barker, Jun 24 2015

a(n) = 9602*a(n-1) - a(n-2) + 200; g.f.: x*(1+198*x+x^2)/((1-x)*(1-9602*x+x^2)). - Warut Roonguthai, Jan 05 2001
a(n+1) = 4801*a(n)+100+980*(24*a(n)^2+a(n))^(1/2). - Richard Choulet, Sep 21 2007
From Ant King, Nov 06 2011: (Start)
a(n) = floor(1/96*(sqrt(2) + sqrt(3))^(8*n-4)).
a(n) = 9603*a(n-1) - 9603*a(n-2) + a(n-3).
(End)

More terms from Eric W. Weisstein

A046173 Indices of square numbers that are also pentagonal.

Original entry on oeis.org

1, 99, 9701, 950599, 93149001, 9127651499, 894416697901, 87643708742799, 8588189040096401, 841554882220704499, 82463790268588944501, 8080609891439495856599, 791817305570802005002201, 77590015336047156994359099, 7603029685627050583442189501

Offset: 1

Eric W. Weisstein

As n increases, this sequence is approximately geometric with common ratio r = lim_{n->oo} a(n)/a(n-1) = (sqrt(2) + sqrt(3))^4 = 49 + 20 * sqrt(6). - Ant King, Nov 07 2011
a(n)^2 is of the form (2*m-1)*(3*m-2), and the corresponding values of m are 1, 41, 3961, 388081, 38027921, 3726348121, 365144087881, ..., with closed form ((5-2*sqrt(6))^(2n-1)+(5+2*sqrt(6))^(2n-1)+14)/24 (for n>0). - Bruno Berselli, Dec 12 2013
The terms of this sequence satisfy the Diophantine equation m^2 = k * (3k-1)/2, which is equivalent to (6k-1)^2 - 6*(2*m)^2 = 1. Now, with x=6k-1 and y=2*m, we get the Pell-Fermat equation x^2 - 6*y^2 = 1. The solutions (x,y) of this equation are respectively in A046174 and A046175. The indices m=y/2 of the square numbers which are also pentagonal are the terms of this sequence, the indices k=(x+1)/6 of the pentagonal numbers which are also square are in A046172, and the pentagonal square numbers are in A036353. - Bernard Schott, Mar 10 2019
Also, this sequence is related to A302330 by (sqrt(2) + sqrt(3))^(4*n-2) = A302330(n-1)*5 + a(n)*sqrt(24). - Bruno Berselli, Oct 29 2019

			G.f. = x + 99*x^2 + 9701*x^3 + 950599*x^4 + 93149001*x^5 + ...
99 is a term because 99^2 = 9801 = (1/2) * 81 * (3*81 - 1), so 9801 is the 99th square number, also the 81st pentagonal number, and the second pentagonal square number after 1. - _Bernard Schott_, Mar 10 2019

E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 35.

Colin Barker, Table of n, a(n) for n = 1..503
M. A. Asiru, All square chiliagonal numbers, Int J Math Edu Sci Technol, 47:7(2016), 1123-1134.
L. Euler, De solutione problematum diophanteorum per numeros integros, par. 21
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Pentagonal Square Number
Index entries for linear recurrences with constant coefficients, signature (98,-1).

Cf. A036353 (pentagonal square numbers), A046172 (indices of pentagonal numbers that are also square).
Cf. A046174, A046175 (solutions of x^2 - 6*y^2 = 1).
Cf. A302330.

CoefficientList[Series[(1 + x)/(1 - 98* x + x^2), {x, 0, 30}], x] (* T. D. Noe, Aug 01 2011 *)
LinearRecurrence[{98, -1}, {1, 99}, 30] (* Harvey P. Dale, Jul 31 2017 *)

{a(n) = subst( poltchebi(n) - poltchebi(n-1), 'x, 49) / 48}; /* Michael Somos, Sep 05 2006 */

Vec(x*(x+1)/(x^2-98*x+1) + O(x^30)) \\ Colin Barker, Jun 23 2015

a(n) = 98*a(n-1) - a(n-2); g.f.: (1+x)/(1-98*x+x^2). - Warut Roonguthai, Jan 05 2001
a(1-n) = -a(n) for all n in Z. - Michael Somos, Sep 05 2006
Define f(x,s) = s*x + sqrt((s^2-1)*x^2+1); f(0,s)=0. a(n) = f(f(a(n-1),5),5). - Marcos Carreira, Dec 27 2006
a(n) = ((12+5*sqrt(6))/24)*(5+2*sqrt(6))^(2*n)+((12-5*sqrt(6))/24)*(5-2*sqrt(6))^(2*n) for n>=0. - Richard Choulet, Apr 29 2009
a(n+1) = 49*a(n) + 10*sqrt(24*a(n)^2+1) for n > =0 with a(0)=1. - Richard Choulet, Apr 29 2009
a(n) = b such that (-1)^n*Integral_{x=-Pi/2..Pi/2} (cos(2*n-1)*x)/(5-sin(x)) dx = c + b*(log(2)-log(3)). - Francesco Daddi, Aug 01 2011
a(n) = floor((1/24) * sqrt(6) * (sqrt(2) + sqrt(3))^(4n-2)). - Ant King, Nov 07 2011
a(n) = A138288(n)*A054320(n). - Gerry Martens, May 13 2024

A124124 Nonnegative integers n such that 2n^2 + 2n - 3 is square.

Original entry on oeis.org

1, 2, 6, 13, 37, 78, 218, 457, 1273, 2666, 7422, 15541, 43261, 90582, 252146, 527953, 1469617, 3077138, 8565558, 17934877, 49923733, 104532126, 290976842, 609257881, 1695937321, 3551015162, 9884647086, 20696833093, 57611945197, 120629983398, 335787024098

Offset: 1

John W. Layman, Nov 29 2006

First differences are apparently in A143608. [R. J. Mathar, Jul 17 2009]

Alternative definition: T_n and (T_n - 1)/2 are triangular numbers. - Raphie Frank, Sep 06 2012

Michael De Vlieger, Table of n, a(n) for n = 1..2613
Jeremiah Bartz, Bruce Dearden, and Joel Iiams, Classes of Gap Balancing Numbers, arXiv:1810.07895 [math.NT], 2018.
Jeremiah Bartz, Bruce Dearden, and Joel Iiams, Counting families of generalized balancing numbers, The Australasian Journal of Combinatorics (2020) Vol. 77, Part 3, 318-325.
Hermann Stamm-Wilbrandt, 4 interlaced bisections
Index entries for linear recurrences with constant coefficients, signature (1,6,-6,-1,1).

Cf. A001108, A001652, A001653, A006452, A008844, A046090, A046172, A077442, A098790, A216134.

A124124 := proc(n)
coeftayl(x*(1+x-2*x^2+x^3+x^4)/((1-x)*(x^2-2*x-1)*(x^2+2*x-1)), x=0, n);
end proc:
seq(A124124(n), n=1..20); # Wesley Ivan Hurt, Aug 04 2014
# Alternative:
a[1]:= 1: a[2]:= 2: a[3]:= 6:
for n from 4 to 1000 do
a[n]:= (3 + 2*(n mod 2))*(a[n-1]-a[n-2])+a[n-3]
od:
seq(a[n],n=1..100); # Robert Israel, Aug 13 2014

LinearRecurrence[{1,6,-6,-1,1},{1,2,6,13,37},40] (* Harvey P. Dale, Nov 05 2011 *)
CoefficientList[Series[(1 + x - 2*x^2 + x^3 + x^4)/((1 - x)*(x^2 - 2*x - 1)*(x^2 + 2*x - 1)), {x, 0, 30}], x] (* Wesley Ivan Hurt, Aug 04 2014 *)

for(n=1,10^10,if(issquare(2*n^2+2*n-3),print1(n,", "))) \\ Derek Orr, Aug 13 2014

It appears that a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) if n is even, a(n) = 5*a(n-1)-5*a(n-2)+a(n-3) if n is odd. Can anyone confirm this?
Corrected and confirmed (using the g.f.) by Robert Israel, Aug 27 2014
2*a(n) = sqrt(7+2*A077442(n-1)^2)-1. - R. J. Mathar, Dec 03 2006
a(n) = a(n-1)+6*a(n-2)-6*a(n-3)-a(n-4)+a(n-5). G.f.: -x*(1+x-2*x^2+x^3+x^4)/((x-1)*(x^2-2*x-1)*(x^2+2*x-1)). [R. J. Mathar, Jul 17 2009]
For n>0, a(2n-1) = 2*A001653(n) - A046090(n-1) and a(2n) = 2*A001653(n) + A001652(n-1). - Charlie Marion, Jan 03 2012
From Raphie Frank, Sep 06 2012: (Start)
If y = A006452(n), then a(n) = 2y + ((sqrt(8y^2 - 7) - 1)/2 - (1 - sgn(n))).
Also see A216134 [a(n) = y + ((sqrt(8y^2 - 7) - 1)/2 - (1 - sgn(n)))].
(End)
From Hermann Stamm-Wilbrandt, Aug 27 2014: (Start)
a(2*n+2) = A098586(2*n).
a(2*n+1) = A098790(2*n).
a(n) = 7*a(n-2) - 7*a(n-4) + a(n-6), for n>6. (End)
a(2*n+1)^2 + (a(2*n+1)+1)^2 = A038761(n)^2 + 2^2. - Hermann Stamm-Wilbrandt, Aug 31 2014

More terms from Harvey P. Dale, Feb 07 2011

More terms from Wesley Ivan Hurt, Aug 04 2014

A248205 Indices of centered octagonal numbers (A016754) that are also pentagonal numbers (A000326).

Original entry on oeis.org

1, 50, 4851, 475300, 46574501, 4563825750, 447208348951, 43821854371400, 4294094520048201, 420777441110352250, 41231895134294472251, 4040304945719747928300, 395908652785401002501101, 38795007668023578497179550, 3801514842813525291721094751

Offset: 1

Colin Barker, Jan 11 2015

Positive integers y in the solutions to 3*x^2 - 8*y^2 - x + 8*y - 2 = 0, the corresponding values of x being A046172.

			50 is in the sequence because the 50th centered octagonal number is 9801, which is also the 81st pentagonal number.

Colin Barker, Table of n, a(n) for n = 1..503
Index entries for linear recurrences with constant coefficients, signature (99,-99,1).

Cf. A000290, A000326, A046172, A036353.

I:=[1,50,4851]; [n le 3 select I[n] else 99*Self(n-1)-99*Self(n-2)+Self(n-3): n in [1..20]]; // Vincenzo Librandi, Jun 13 2015

LinearRecurrence[{99, -99, 1}, {1, 50, 4851}, 20] (* Vincenzo Librandi, Jun 13 2015 *)

Vec(x*(49*x-1)/((x-1)*(x^2-98*x+1)) + O(x^100))

a(n) = 99*a(n-1) - 99*a(n-2) + a(n-3).
G.f.: x*(49*x-1) / ((x-1)*(x^2 - 98*x + 1)).
a(n) = (1/2+1/48*(49+20*sqrt(6))^(-n)*(-12-5*sqrt(6)+(-12+5*sqrt(6))*(49+20*sqrt(6))^(2*n))). - Colin Barker, Mar 03 2016

A173205 a(n) = 98*a(n-1)-a(n-2) for n>2, a(1)=1, a(2)=98.

Original entry on oeis.org

1, 98, 9603, 940996, 92208005, 9035443494, 885381254407, 86758327488392, 8501430712608009, 833053451508096490, 81630736817080848011, 7998979154622415008588, 783818326416179589993613

Offset: 1

Sture Sjöstedt, Feb 12 2010

Similar to A046173 and A046172.

Indranil Ghosh, Table of n, a(n) for n = 1..502
R. Flórez, R. A. Higuita, and A. Mukherjee, Alternating Sums in the Hosoya Polynomial Triangle, Article 14.9.5 Journal of Integer Sequences, Vol. 17 (2014).
Index entries for linear recurrences with constant coefficients, signature (98,-1).

Cf. A046172, A046173.

CoefficientList[Series[x/(1-98x+x^2),{x,0,20}],x]  (* Harvey P. Dale, Mar 13 2011 *)

a(n) = ((49+20*sqrt(6))^n - (49-20*sqrt(6))^n)/(40*sqrt(6)).

G.f.: x/(1-98*x+x^2). - R. J. Mathar, Feb 13 2010

More terms from R. J. Mathar, Feb 13 2010

Definition rewritten (with Mathar's recurrence) by Bruno Berselli, Nov 10 2011

A251914 Numbers n such that the sum of the triangular numbers T(n) and T(n+1) is equal to the pentagonal number P(m) for some m.

Original entry on oeis.org

0, 98, 9700, 950598, 93149000, 9127651498, 894416697900, 87643708742798, 8588189040096400, 841554882220704498, 82463790268588944500, 8080609891439495856598, 791817305570802005002200, 77590015336047156994359098, 7603029685627050583442189500

Offset: 1

Colin Barker, Dec 11 2014

Also nonnegative integers x in the solutions to 2*x^2-3*y^2+4*x+y+2 = 0, the corresponding values of y being A046172.

			98 is in the sequence because T(98)+T(99) = 4851+4950 = 9801 = P(81).

Colin Barker, Table of n, a(n) for n = 1..503
Index entries for linear recurrences with constant coefficients, signature (99,-99,1).

Cf. A000217, A000326, A046172.

LinearRecurrence[{99, -99, 1}, {0, 98, 9700}, 20] (* Vincenzo Librandi, Mar 03 2016 *)

concat(0, Vec(2*x^2*(x-49) / ((x-1)*(x^2-98*x+1)) + O(x^100)))

a(n) = A046173(n)-1.
a(n) = 99*a(n-1)-99*a(n-2)+a(n-3).
G.f.: 2*x^2*(x-49) / ((x-1)*(x^2-98*x+1)).
a(n) = 2*(-1/2+1/48*(49+20*sqrt(6))^(-n)*(-12-5*sqrt(6)+(-12+5*sqrt(6))*(49+20*sqrt(6))^(2*n))). - Colin Barker, Mar 03 2016

cp's OEIS Frontend

A001079 a(n) = 10*a(n-1) - a(n-2); a(0) = 1, a(1) = 5.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Formula

Extensions

A072256 a(n) = 10*a(n-1) - a(n-2) for n > 1, a(0) = a(1) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Formula

Extensions

A036353 Square pentagonal numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A046173 Indices of square numbers that are also pentagonal.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A124124 Nonnegative integers n such that 2n^2 + 2n - 3 is square.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A248205 Indices of centered octagonal numbers (A016754) that are also pentagonal numbers (A000326).

Views

Author

Keywords