A077428 -id:A077428 - cp's OEIS frontend

A078355 Minimal (positive) solution a(n) of Pell equation b(n)^2 - D(n)*a(n)^2 = +4 with D(n)= A077425(n). The companion sequence is a(n)=A077428(n).

1, 3, 16, 1, 5, 8, 24, 640, 1, 7, 40, 195, 32, 3, 534000, 1, 9, 106000, 3, 12754704, 40, 8, 6525, 226592, 1, 11, 2968, 15, 1039424, 16, 48, 305, 352, 3621, 1856, 1, 13, 9384, 126585, 1360, 8, 896073208080, 56, 72664, 3, 6440, 5, 521904, 1, 15, 140510608, 5

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

For the conversion of the (x,y) values of Perron's table to the (b(n),a(n)) values see a A077428 comment.

For the general solution of Pell b^2 - D(n)*a^2 = +4 see a comment in A077428 (with a and b interchanged).

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

S. R. Finch, Class number theory
Steven R. Finch, Class number theory [Cached copy, with permission of the author]

d = Select[Range[5, 300, 4], !IntegerQ[Sqrt[#]]&]; a[n_] := Module[{a, b, r}, b /. {r = Reduce[a > 0 && b > 0 && a^2 - d[[n]]*b^2 == 4, {a, b}, Integers]; (r /. C[1] -> 0) || (r /. C[1] -> 1) // ToRules} // Select[#, IntegerQ, 1] &] // First; Table[a[n], {n, 1, 52}] (* Jean-François Alcover, Jul 30 2013 *)

More terms from Max Alekseyev, Mar 03 2010

A078371 a(n) = (2n+5)(2*n+1).

Original entry on oeis.org

5, 21, 45, 77, 117, 165, 221, 285, 357, 437, 525, 621, 725, 837, 957, 1085, 1221, 1365, 1517, 1677, 1845, 2021, 2205, 2397, 2597, 2805, 3021, 3245, 3477, 3717, 3965, 4221, 4485, 4757, 5037, 5325, 5621, 5925, 6237, 6557, 6885, 7221, 7565, 7917, 8277, 8645

Offset: 0

Wolfdieter Lang, Nov 29 2002

This is the generic form of D in the (nontrivially) solvable Pell equation x^2 - D*y^2 = +4. See A077428 and A078355.
Consider all primitive Pythagorean triples (a,b,c) with c-a=8, sequence gives values of a. (Corresponding values for b are A017113(n), while c follows A078370(n).) - Lambert Klasen (Lambert.Klasen(AT)gmx.net), Nov 19 2004
From Vincenzo Librandi, Aug 08 2010: (Start)
The identity (4*n^3 + 18*n^2 + 24*n + 9)^2 - (4*n^2 + 12*n + 5)*(2*n^2 + 6*n + 4)^2 = 1 (see Ramasamy's paper in link) can be written as A141530(n+2)^2 - a(n)*A046092(n+1)^2 = 1.
a(n)^3 + 6*a(n)^2 + 9*a(n) + 4 is a square: in fact, a(n)^3 + 6*a(n)^2 + 9*a(n) + 4 = (a(n) + 1)^2*(a(n) + 4), where a(n) + 4 = (2*n+3)^2. (End)
Products of two positive odd integers with difference 4 (i.e., 1*5, 3*7, 5*9, 7*11, 9*13, ...). - Wesley Ivan Hurt, Nov 19 2013
Starting with stage 1, the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 675", based on the 5-celled von Neumann neighborhood. - Robert Price, May 21 2016
The continued fraction expansion of (sqrt(a(n))-1)/2 is [n; {1,2*n+1}] with periodic part of length 2: repeat {1,2*n+1}. - Ron Knott, May 11 2017
a(n) is the sum of 2*n+5 consecutive integers starting from n-1. - Bruno Berselli, Jan 16 2018
The continued fraction expansion of sqrt(a(n)) is [2n+2; {1, n, 2, n, 1, 4n+4}]. For n=0, this collapses to [2; {4}]. - Magus K. Chu, Aug 26 2022

Bruno Berselli, Table of n, a(n) for n = 0..1000
Soren Laing Aletheia-Zomlefer, Lenny Fukshansky, and Stephan Ramon Garcia, The Bateman-Horn Conjecture: Heuristics, History, and Applications, arXiv:1807.08899 [math.NT], 2018-2019. See Example 6.6.5 p. 34.
A. M. S. Ramasamy, Polynomial solutions for the Pell's equation, Indian Journal of Pure and Applied Mathematics 25 (1994), p. 578.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Subsequence of A077425 (D values (not a square) for which Pell x^2 - D*y^2 = +4 is solvable in positive integers).
Cf. A017113, A046092, A061037, A077428, A078355, A078370.
Supersequence of A143206.

[(2*n+5)*(2*n+1): n in [0..100]]; // G. C. Greubel, Sep 19 2018

seq((2*n+5)*(2*n+1), n=0..48); # Emeric Deutsch, Feb 24 2005

Table[(2 n + 5) (2 n + 1), {n, 0, 100}] (* Wesley Ivan Hurt, Nov 19 2013 *)
LinearRecurrence[{3,-3,1},{5,21,45},50] (* Harvey P. Dale, Oct 18 2020 *)

lista(nn) = {for (n=0, nn, print1((2*n+1)*(2*n+5), ", "));} \\ Michel Marcus, Nov 21 2013

a(n) = 8*(binomial(n+2, 2)-1)+5, hence subsequence of A004770 (5 (mod 8) numbers).
G.f.: (5 + 6*x - 3*x^2)/(1-x)^3.
a(n) = A061037(2*n+1) = (2*n+3)^2 - 4. For A061037: a(2*n+1) = (2*n+1)*(2*n+5) = (2*n+3)^2-4. - Paul Curtz, Sep 24 2008
a(n) = 8*(n+1) + a(n-1) for n > 0, a(0)=5. - Vincenzo Librandi, Aug 08 2010
From Ilya Gutkovskiy, May 22 2016: (Start)
E.g.f.: (5 + 4*x*(4 + x))*exp(x).
Sum_{n>=0} 1/a(n) = 1/3. (End)
Sum_{n>=0} (-1)^n/a(n) = 1/6. - Amiram Eldar, Oct 08 2023

More terms from Emeric Deutsch, Feb 24 2005

A077425 a(n) == 1 (mod 4) (see A016813), but not a square (i.e., not in A000290).

Original entry on oeis.org

5, 13, 17, 21, 29, 33, 37, 41, 45, 53, 57, 61, 65, 69, 73, 77, 85, 89, 93, 97, 101, 105, 109, 113, 117, 125, 129, 133, 137, 141, 145, 149, 153, 157, 161, 165, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209, 213, 217, 221, 229, 233, 237, 241, 245, 249, 253, 257

Offset: 1

Wolfdieter Lang, Nov 29 2002

The Pell equation x^2 - a(n)*y^2 = +4 has infinitely many (integer) solutions (see A077428 and A078355).
These are the odd numbers in A079896. The even ones are 4*A000037. - Wolfdieter Lang, Sep 15 2015
First differences: 8, 4, 4, 8, 4, 4, 4, 4, 8, 4, 4, 4, 4, 4, 4, 8, ... , only 4's and 8's?. - Paul Curtz, Apr 11 2019
Yes. There are only 4's and 8's. Proof: Only multiples of 4 may appear. The 4's correspond to successive composite in A016813, whereas an 8 corresponds to a square. A greater multiple of 4 would imply to have at least 2 consecutive squares in A016813, which is not possible since 2 consecutive squares cannot have a difference of 4. That sequence of 4's and 8's can be obtained with A010052 (without the 1st term) where the 0's are replaced with 4's and 1's replaced with 8's. - Michel Marcus, Apr 16 2019

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
S. R. Finch, Class number theory [Cached copy, with permission of the author]
A. M. Legendre, Expression les plus simples des formules Ly^2+Myz+Nz^2 où M est impair pour toutes les valeurs de B = M^2-4LN depuis B=5 jusqu'à B=305, Essai sur la Théorie des Nombres An VI, Table II. [_Paul Curtz_, Apr 11 2019]

Intersection of A016813 and A000037.

Cf. A077426, A079896.

A077425 := proc(n::integer) local resul,i ; resul := 5 ; i := 1 ; while i < n do resul := resul+4 ; while issqr(resul) do resul := resul+4 ; od ; i:= i+1 ; od ; RETURN(resul) ; end proc:
seq(A077425(n),n=1..31) ; # R. J. Mathar, Apr 25 2006

Select[Range[5,300,4],!IntegerQ[Sqrt[#]]&] (* Harvey P. Dale, Dec 05 2012 *)

[n | n <- vector(100,n,4*n+1), !issquare(n)] \\ Charles R Greathouse IV, Mar 11 2014

list(lim)=my(v=List()); for(s=2,sqrtint((lim\=1)+1), forstep(n=s^2 + if(s%2,4,1), min((s+1)^2-1,lim), 4, listput(v,n))); Vec(v) \\ Charles R Greathouse IV, Nov 04 2021

from operator import sub
from sympy import integer_nthroot
def A077425(n): return n+sub(*integer_nthroot(n,2))<<2|1 # Chai Wah Wu, Oct 01 2024

More terms from Max Alekseyev, Mar 03 2010

A078364 A Chebyshev S-sequence with Diophantine property.

Original entry on oeis.org

1, 15, 224, 3345, 49951, 745920, 11138849, 166336815, 2483913376, 37092363825, 553901543999, 8271430796160, 123517560398401, 1844491975179855, 27543862067299424, 411313439034311505

Offset: 0

Wolfdieter Lang, Nov 29 2002

a(n) gives the general (positive integer) solution of the Pell equation b^2 - 221*a^2 = +4 with companion sequence b(n)=A078365(n+1), n>=0.
This is the m=17 member of the m-family of sequences S(n,m-2) = S(2*n+1,sqrt(m))/sqrt(m). The m=4..16 (nonnegative) sequences are: A000027, A001906, A001353, A004254, A001109, A004187, A001090, A018913, A004189, A004190, A004191, A078362 and A007655. The m=1..3 (signed) sequences are A049347, A056594, A010892.
For positive n, a(n) equals the permanent of the n X n tridiagonal matrix with 15's along the main diagonal, and i's along the superdiagonal and the subdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
For n>=2, a(n) equals the number of 01-avoiding words of length n-1 on alphabet {0,1,...,14}. - Milan Janjic, Jan 23 2015

Harvey P. Dale, Table of n, a(n) for n = 0..850
A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434. Case a=0,b=1; p=15, q=-1.
Tanya Khovanova, Recursive Sequences
W. Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eq.(44), lhs, m=17.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (15,-1).

a(n) = sqrt((A078365(n+1)^2 - 4)/221), n>=0, (Pell equation d=221, +4).

Cf. A077428, A078355 (Pell +4 equations).

LinearRecurrence[{15,-1},{1,15},30] (* Harvey P. Dale, Oct 16 2011 *)

[lucas_number1(n,15,1) for n in range(1,20)] # Zerinvary Lajos, Jun 25 2008

a(n) = 15*a(n-1) - a(n-2), n>= 1; a(-1)=0, a(0)=1.
a(n) = S(2*n+1, sqrt(17))/sqrt(17) = S(n, 15); S(n, x) := U(n, x/2), Chebyshev polynomials of the 2nd kind, A049310.
a(n) = (ap^(n+1) - am^(n+1))/(ap-am) with ap = (15+sqrt(221))/2 and am = (15-sqrt(221))/2.
G.f.: 1/(1 - 15*x + x^2). - Philippe Deléham, Nov 17 2008
a(n) = Sum_{k=0..n} A101950(n,k)*14^k. - Philippe Deléham, Feb 10 2012
Product {n >= 0} (1 + 1/a(n)) = 1/13*(13 + sqrt(221)). - Peter Bala, Dec 23 2012
Product {n >= 1} (1 - 1/a(n)) = 1/30*(13 + sqrt(221)). - Peter Bala, Dec 23 2012
For n>=1, a(n) = U(n-1,15/2), where U(k,x) is Chebyshev polynomial of the second kind. - Milan Janjic, Jan 23 2015

A078356 Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.

Original entry on oeis.org

1, 3, 8, 5, 12, 64, 7, 39, 16, 2136, 9, 1000, 11208, 20, 261, 1552, 11, 3488, 24, 61, 213, 13, 1305, 136, 3528264, 28, 15, 46312, 142022136, 32, 12144, 164, 2613, 2127064, 17, 253724736, 89, 36, 2031654672, 18420, 142528, 19, 10236, 2564, 3447, 40, 223843593936

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

The corresponding values of t are given in A078357.
Computed from Perron's table (see reference p. 108) which gives the minimal x,y values for the Diophantine equation x^2 - x*y - ((D(m)-1)/4)*y^2 = +1 and -1 for respectively D(m)=A077425(m) and D(m)=A077426(m) (this second case excludes in Perron's table the D values with a 'Teilnenner' in brackets).
The conversion from the x,y values of Perron's table to the minimal a=a(n) and b=b(n) solutions of a^2 - D(n)*b^2 =-4 see a comment in A077428. Here only D values with no 'Teilnenner' in brackets are of interest and a(n)=2*x(n)-y(n) and b(n)=y(n). E.g. D=41, with 'Teilnenner von (sqrt(D)+1)/2' in the notation, explained in an example of A077427, 3,1,2 (period length k=5) and (x,y)=(37,10) which translates to the minimal solution (a,b)=(64,10).
Generic D(n) values are those from A078370(k)=(4*k(k+1)+5), k>=0, which are 5 (mod 8). For such D values the minimal solution is (a,b)=(2*k+1,1) (e.g. D(7)= A077426(7) = 53 = A078370(3) with a(7)= 2*3+1=7 and b(7)=A078357(7)=1).
The general solution of Pell a^2-D(n)*b^2 = -4 with generic D(n)=A078370(k), k>=0, is a(n,m)= (2*k+1)*S(2*m,sqrt(D(n))) and b(n,m)= T(2*m+1,sqrt(D(n))/2)/(sqrt(D(n))/2), m>=0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second, kind. See A053120 resp. A049310.
For non-generic D(n) (not from A078370) the general solution of a^2-D(n)*b^2 = -4 is a(n,m)=a(n)*S(2*m,sqrt(a(n)^2+4)) and b(n,m)= b(n)*T(2*m+1,sqrt(a(n)^2+4)/2)/(sqrt(a(n)^2+4)/2), m>=0, with Chebyshev's polynomials and in this case b(n)>1.

			41=D(6)=A077426(6) (also A077425(8)), hence a(6)=64 and b(6)=A078357(6)=10 satisfies 64^2 - 41*10^2 = -4.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Vincenzo Librandi, Table of n, a(n) for n = 1..200
Index entries for sequences related to Chebyshev polynomials.

$MaxExtraPrecision = 100; A077426 = Select[Range[ 500], ! IntegerQ[Sqrt[#]] && OddQ[ Length[ ContinuedFraction[(Sqrt[#] + 1)/2] // Last]] &]; a[n_] := {z, t} /. {ToRules[ Reduce[z > 0 && t > 0 && z^2 - A077426[[n]]*t^2 == -4, {z, t}, Integers] /. C[1] -> 0]} // Sort // First // First; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Jun 21 2013 *)

More terms from R. J. Mathar, Sep 24 2009

Edited by Max Alekseyev, Mar 03 2010

A078366 A Chebyshev S-sequence with Diophantine property.

Original entry on oeis.org

1, 17, 288, 4879, 82655, 1400256, 23721697, 401868593, 6808044384, 115334885935, 1953885016511, 33100710394752, 560758191694273, 9499788548407889, 160935647131239840, 2726406212682669391, 46187969968474139807, 782469083251377707328, 13255786445304946884769

Offset: 0

Wolfdieter Lang, Nov 29 2002

a(n) gives the general (positive integer) solution of the Pell equation b^2 - 285*a^2 = +4 with companion sequence b(n)=A078367(n+1), n >= 0.
This is the m=19 member of the m-family of sequences S(n,m-2) = S(2*n+1,sqrt(m))/sqrt(m). The m=4..18 (nonnegative) sequences are: A000027, A001906, A001353, A004254, A001109, A004187, A001090, A018913, A004189, A004190, A004191, A078362, A007655, A078364 and A077412. The m=1..3 (signed) sequences are A049347, A056594, A010892.
For positive n, a(n) equals the permanent of the n X n tridiagonal matrix with 17's along the main diagonal, and i's along the superdiagonal and the subdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
For n >= 2, a(n) equals the number of 01-avoiding words of length n-1 on alphabet {0,1,...,16}. - Milan Janjic, Jan 23 2015

Vincenzo Librandi, Table of n, a(n) for n = 0..800
A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434. Case a=0,b=1; p=17, q=-1.
Tanya Khovanova, Recursive Sequences
Wolfdieter Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eq.(44), lhs, m=19.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (17,-1).

Cf. A077428, A078355 (Pell +4 equations). Cf. A078367.

a:=[1,17,288];; for n in [4..20] do a[n]:=17*a[n-1]-a[n-2]; od; a; # G. C. Greubel, May 25 2019

I:=[1, 17, 288]; [n le 3 select I[n] else 17*Self(n-1)-Self(n-2): n in [1..20]]; // Vincenzo Librandi, Dec 24 2012

CoefficientList[Series[1/(1 - 17 x + x^2), {x, 0, 20}], x] (* Vincenzo Librandi, Dec 24 2012 *)
LinearRecurrence[{17,-1},{1,17},20] (* Harvey P. Dale, Aug 02 2018 *)

my(x='x+O('x^20)); Vec(1/(1-17*x+x^2)) \\ G. C. Greubel, May 25 2019

[lucas_number1(n,17,1) for n in range(1,20)] # Zerinvary Lajos, Jun 25 2008

a(n) = 17*a(n-1) - a(n-2), n >= 1; a(-1)=0, a(0)=1.
a(n) = S(2*n+1, sqrt(19))/sqrt(19) = S(n, 17), where S(n, x) = U(n, x/2), Chebyshev polynomials of the 2nd kind, A049310.
a(n) = (ap^(n+1) - am^(n+1))/(ap-am) with ap = (17+sqrt(285))/2 and am = (17-sqrt(285))/2.
G.f.: 1/(1-17*x+x^2).
a(n) = Sum_{k=0..n} A101950(n,k)*16^k. - Philippe Deléham, Feb 10 2012
Product {n >= 0} (1 + 1/a(n)) = (1/15)*(15 + sqrt(285)). - Peter Bala, Dec 23 2012
Product {n >= 1} (1 - 1/a(n)) = (1/34)*(15 + sqrt(285)). - Peter Bala, Dec 23 2012
For n >= 1, a(n) = U(n-1,13/2), where U(k,x) represents Chebyshev polynomial of the second order. - Milan Janjic, Jan 23 2015
a(n) = sqrt((A078367(n+1)^2 - 4)/285), n>=0, (Pell equation d=285, +4).
E.g.f.: exp(17*x/2)*(sqrt(285)*cosh(sqrt(285)*x/2) + 17*sinh(sqrt(285)*x/2))/sqrt(285). - Stefano Spezia, Aug 19 2023

A078365 A Chebyshev T-sequence with Diophantine property.

Original entry on oeis.org

2, 15, 223, 3330, 49727, 742575, 11088898, 165590895, 2472774527, 36926027010, 551417630623, 8234338432335, 122963658854402, 1836220544383695, 27420344506901023, 409468947059131650

Offset: 0

Wolfdieter Lang, Nov 29 2002

a(n) gives the general (positive integer) solution of the Pell equation a^2 - 221*b^2 =+4 with companion sequence b(n)=A078364(n-1), n>=1.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Harvey P. Dale, Table of n, a(n) for n = 0..851
Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (15,-1).

a(n)=sqrt(4 + 221*A078364(n-1)^2), n>=1, (Pell equation d=221, +4).

Cf. A077428, A078355 (Pell +4 equations).

a[0] = 2; a[1] = 15; a[n_] := 15a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)
LinearRecurrence[{15,-1},{2,15},20] (* Harvey P. Dale, Nov 09 2022 *)

[lucas_number2(n,15,1) for n in range(0,20)] # Zerinvary Lajos, Jun 26 2008

a(n)=15*a(n-1)-a(n-2), n >= 1; a(-1)=15, a(0)=2.
a(n) = S(n, 15) - S(n-2, 15) = 2*T(n, 15/2) with S(n, x) := U(n, x/2), S(-1, x) := 0, S(-2, x) := -1. S(n, 15)=A078364(n). U-, resp. T-, are Chebyshev's polynomials of the second, resp. first, case. See A049310 and A053120.
G.f.: (2-15*x)/(1-15*x+x^2).
a(n) = ap^n + am^n, with ap := (15+sqrt(221))/2 and am := (15-sqrt(221))/2.

A078367 A Chebyshev T-sequence with Diophantine property.

Original entry on oeis.org

2, 17, 287, 4862, 82367, 1395377, 23639042, 400468337, 6784322687, 114933017342, 1947076972127, 32985375508817, 558804306677762, 9466687838013137, 160374888939545567, 2716906424134261502, 46027034321342899967, 779742677038695037937, 13209598475336472744962

Offset: 0

Wolfdieter Lang, Nov 29 2002

a(n) gives the general (positive integer) solution of the Pell equation a^2 - 285*b^2 =+4 with companion sequence b(n)=A078366(n-1), n>=1.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Stefano Spezia, Table of n, a(n) for n = 0..800
Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (17,-1).

Cf. A077428, A078355 (Pell +4 equations).

Cf. A049310, A053120, A078366.

a[0] = 2; a[1] = 17; a[n_] := 17a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)

a(n)=if(n<0,0,subst(2*poltchebi(n),x,17/2))

[lucas_number2(n,17,1) for n in range(0,20)] # Zerinvary Lajos, Jun 26 2008

a(n) = 17*a(n-1)-a(n-2), n >= 1; a(-1)=17, a(0)=2.
a(n) = sqrt(4 + 285*A078366(n-1)^2), n>=1, (Pell equation d=285, +4).
a(n) = S(n, 17) - S(n-2, 17) = 2*T(n, 17/2) with S(n, x) := U(n, x/2), S(-1, x) := 0, S(-2, x) := -1. S(n, 17)=A078366(n). U-, resp. T-, are Chebyshev's polynomials of the second, resp. first, case. See A049310 and A053120.
G.f.: (2-17*x)/(1-17*x+x^2).
a(n) = ap^n + am^n, with ap := (17+sqrt(285))/2 and am := (17-sqrt(285))/2.
E.g.f.: 2*exp(17*x/2)*cosh(sqrt(285)*x/2). - Stefano Spezia, Aug 19 2023

More terms from Stefano Spezia, Aug 19 2023

A090248 a(n) = 27a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 27.

Original entry on oeis.org

2, 27, 727, 19602, 528527, 14250627, 384238402, 10360186227, 279340789727, 7531841136402, 203080369893127, 5475638145978027, 147639149571513602, 3980781400284889227, 107333458658120495527, 2894022602368968490002, 78031276805304028734527

Offset: 0

Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 24 2004

a(n+1)/a(n) converges to ((27+sqrt(725))/2) = 26.96291201...
Lim a(n)/a(n+1) as n approaches infinity = 0.03708798... = 2/(27+sqrt(725)) = (27-sqrt(725))/2.
Lim a(n+1)/a(n) as n approaches infinity = 26.96291201... = (27+sqrt(725))/2 = 2/(27-sqrt(725)).
Lim a(n)/a(n+1) = 27 - Lim a(n+1)/a(n).
A Chebyshev T-sequence with Diophantine property.
a(n) gives the general (nonnegative integer) solution of the Pell equation a^2 - 29*(5*b)^2 =+4 with companion sequence b(n)=A097781(n-1), n>=0.

			a(4) = 528527 = 27a(3) - a(2) = 27*19602 - 727 = ((27+sqrt(725))/2)^4 + ((27-sqrt(725))/2)^4 = 528526.999998107 + 0.000001892 = 528527.
(x;y) = (2;0), (27;1), (727;27), (19602;728), ... give the nonnegative integer solutions to x^2 - 29*(5*y)^2 = +4.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Index entries for linear recurrences with constant coefficients, signature (27, -1).
Index entries for sequences related to Chebyshev polynomials.

Cf. A046213, A078046.
a(n)=sqrt(4 + 29*(5*A097781(n-1))^2), n>=1.
Cf. A077428, A078355 (Pell +4 equations).
Cf. A090733 for 2*T(n, 25/2).
Cf. A087130.

a[0] = 2; a[1] = 27; a[n_] := 27a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)
RecurrenceTable[{a[0]==2,a[1]==27,a[n]==27a[n-1]-a[n-2]},a,{n,20}] (* or *) LinearRecurrence[{27,-1},{2,27},20] (* Harvey P. Dale, Jan 03 2018 *)

{a(n) = (-1)^n * subst(2 * poltchebi(2*n), 'x, -5/2 * I)}; /* Michael Somos, Nov 04 2008 */

def aupton(idx):
  alst = [2, 27]
  for n in range(2, idx+1): alst.append(27*alst[-1] - alst[-2])
  return alst
print(aupton(16)) # Michael S. Branicky, Feb 27 2021

[lucas_number2(n,27,1) for n in range(0,16)] # Zerinvary Lajos, Jun 27 2008

a(n) = 27a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 27. a(n) = ((27+sqrt(725))/2)^n + ((27-sqrt(725))/2)^n, (a(n))^2 = a(2n)+2.
a(n) = S(n, 27) - S(n-2, 27) = 2*T(n, 27/2) with S(n, x) := U(n, x/2), S(-1, x) := 0, S(-2, x) := -1. S(n, 27)=A097781(n). U-, resp. T-, are Chebyshev's polynomials of the second, resp. first, kind. See A049310 and A053120.
a(n) = ap^n + am^n, with ap := (27+5*sqrt(29))/2 and am := (27-5*sqrt(29))/2.
G.f.: (2-27*x)/(1-27*x+x^2).
a(-n) = a(n). - Michael Somos, Nov 01 2008
A087130(2*n) = a(n). - Michael Somos, Nov 01 2008

More terms from Robert G. Wilson v, Jan 30 2004

Chebyshev and Pell comments from Wolfdieter Lang, Aug 31 2004

A090731 a(n) = 23a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 23.

Original entry on oeis.org

2, 23, 527, 12098, 277727, 6375623, 146361602, 3359941223, 77132286527, 1770682648898, 40648568638127, 933146396028023, 21421718540006402, 491766380024119223, 11289205022014735727, 259159949126314802498

Offset: 0

Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 18 2004

A Chebyshev T-sequence with Diophantine property.

a(n) gives the general (nonnegative integer) solution of the Pell equation a^2 - 21*(5*b)^2 =+4 with companion sequence b(n)=A097778(n-1), n>=1; b(0):=0.

			(x;y) = (0;2), (23;1), (527;23), (12098;528), ... give the
nonnegative integer solutions to x^2 - 21*(5*y)^2 = 4.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Indranil Ghosh, Table of n, a(n) for n = 0..733
Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (23,-1).

Cf. A037088, A051502.
a(n)=sqrt(4 + 21*(5*A097778(n-1))^2), n>=1.
Cf. A077428, A078355 (Pell +4 equations).

a[0] = 2; a[1] = 23; a[n_] := 23a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)
LinearRecurrence[{23,-1},{2,23},30] (* Harvey P. Dale, Feb 20 2012 *)

[lucas_number2(n,23,1) for n in range(0,20)] # Zerinvary Lajos, Jun 26 2008

a(n) = S(n, 23) - S(n-2, 23) = 2*T(n, 23/2) with S(n, x) := U(n, x/2), S(-1, x) := 0, S(-2, x) := -1. S(n, 23)=A097778(n). U-, resp. T-, are Chebyshev's polynomials of the second, resp. first, case. See A049310 and A053120.
a(n) = ap^n + am^n, with ap := (23+5*sqrt(21))/2 and am := (23-5*sqrt(21))/2.
G.f.: (2-23*x)/(1-23*x+x^2).

Chebyshev and Pell comments from Wolfdieter Lang, Sep 10 2004

cp's OEIS Frontend

A078355 Minimal (positive) solution a(n) of Pell equation b(n)^2 - D(n)*a(n)^2 = +4 with D(n)= A077425(n). The companion sequence is a(n)=A077428(n).

Views

Author

Keywords

Comments

References

Links

Programs

Mathematica

Extensions

A078371 a(n) = (2*n+5)*(2*n+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A077425 a(n) == 1 (mod 4) (see A016813), but not a square (i.e., not in A000290).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Extensions

A078364 A Chebyshev S-sequence with Diophantine property.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Sage

Formula

A078356 Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.

Views

Author

Keywords

Comments

Examples

References

Links

Programs

Mathematica

Extensions

A078366 A Chebyshev S-sequence with Diophantine property.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A078365 A Chebyshev T-sequence with Diophantine property.

Views

Author

Keywords

Comments

A078371 a(n) = (2n+5)(2*n+1).