cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A097742 Pell equation solutions (10*b(n))^2 - 101*a(n)^2 = -1 with b(n)=A097741(n), n >= 0.

Original entry on oeis.org

1, 401, 161201, 64802401, 26050404001, 10472197606001, 4209797387208401, 1692328077460171201, 680311677341601614401, 273483601963246388818001, 109939727677547706703222001, 44195497042772214848306426401, 17766479871466752821312480191201, 7142080712832591861952768730436401
Offset: 0

Views

Author

Wolfdieter Lang, Aug 31 2004

Keywords

Examples

			(x,y) = (10*1=10;1), (4030=10*403;401), (1620050=10*162005;161201), ... give the positive integer solutions to x^2 - 101*y^2 =-1.
		

Crossrefs

Cf. A097740 for S(n, 402).
Row 10 of array A188647.

Programs

  • GAP
    a:=[1,401];; for n in [3..20] do a[n]:=402*a[n-1]-a[n-2]; od; a; # G. C. Greubel, Aug 01 2019
  • Magma
    I:=[1,401]; [n le 2 select I[n] else 402*Self(n-1) - Self(n-2): n in [1..20]]; // G. C. Greubel, Aug 01 2019
    
  • Mathematica
    LinearRecurrence[{402, -1},{1, 401},12] (* Ray Chandler, Aug 12 2015 *)
  • PARI
    my(x='x+O('x^20)); Vec((1-x)/(1-402*x+x^2)) \\ G. C. Greubel, Aug 01 2019
    
  • Sage
    ((1-x)/(1-402*x+x^2)).series(x, 20).coefficients(x, sparse=False) # G. C. Greubel, Aug 01 2019
    

Formula

a(n) = S(n, 2*201) - S(n-1, 2*201) = T(2*n+1, sqrt(101))/sqrt(101), with Chebyshev polynomials of the 2nd and first kind. See A049310 for the triangle of S(n, x)= U(n, x/2) coefficients. S(-1, x) := 0 =: U(-1, x); and A053120 for the T-triangle.
a(n) = ((-1)^n)*S(2*n, 20*i) with the imaginary unit i and Chebyshev polynomials S(n, x) with coefficients shown in A049310.
G.f.: (1-x)/(1-402*x+x^2).
a(n) = 402*a(n-1) - a(n-2), n > 1; a(0)=1, a(1)=401. - Philippe Deléham, Nov 18 2008

A097775 Pell equation solutions (14*a(n))^2 - 197*b(n)^2 = -1 with b(n) = A097776(n), n >= 0.

Original entry on oeis.org

1, 787, 618581, 486203879, 382155630313, 300373839222139, 236093455472970941, 185569155627915937487, 145857120230086453893841, 114643510931692324844621539, 90109653735189937241418635813, 70826073192348358979430203127479, 55669203419532074967894898239562681
Offset: 0

Views

Author

Wolfdieter Lang, Aug 31 2004

Keywords

Examples

			(x,y) = (14*1=14;1), (11018=14*787;785), (8660134=14*618581;617009), ... give the positive integer solutions to x^2 - 197*y^2 =-1.
		

Crossrefs

Cf. A097774 for S(n, 2*393).
Cf. similar sequences of the type (1/k)*sinh((2*n + 1)*arcsinh(k)): A002315 (k=1), A049629 (k=2), A097314 (k=3), A078989 (k=4), A097726 (k=5), A097729 (k=6), A097732 (k=7), A097735 (k=8), A097738 (k=9), A097741 (k=10), A097766 (k=11), A097769 (k=12), A097772 (k=13), this sequence (k=14).

Programs

  • Mathematica
    LinearRecurrence[{786, -1}, {1, 787}, 20] (* Harvey P. Dale, Dec 12 2017 *)
  • PARI
    Vec((1+x)/(1-2*393*x+x^2) + O(x^100)) \\ Colin Barker, Apr 04 2015

Formula

G.f.: (1 + x)/(1 - 2*393*x + x^2).
a(n) = S(n, 2*393) + S(n-1, 2*393) = S(2*n, 2*sqrt(197)), with Chebyshev polynomials of the 2nd kind. See A049310 for the triangle of S(n, x) = U(n, x/2) coefficients. S(-1, x) = 0 = U(-1, x).
a(n) = ((-1)^n)*T(2*n+1, 14*i)/(14*i) with the imaginary unit i and Chebyshev polynomials of the first kind. See the T-triangle A053120.
a(n) = 786*a(n-1) - a(n-2) for n > 1; a(0)=1, a(1)=787. - Philippe Deléham, Nov 18 2008
a(n) = (1/14)*sinh((2*n + 1)*arcsinh(14)). - Bruno Berselli, Apr 05 2018

A097740 Chebyshev U(n,x) polynomial evaluated at x=201.

Original entry on oeis.org

1, 402, 161603, 64964004, 26115368005, 10498312974006, 4220295700182407, 1696548373160353608, 682008225714761968009, 274165610188961150786010, 110213893287736667854008011, 44305710936059951516160434412
Offset: 0

Views

Author

Wolfdieter Lang, Aug 31 2004

Keywords

Comments

Used to form integer solutions of Pell equation a^2 - 101*b^2 =-1. See A097741 with A097742.

Programs

  • Mathematica
    LinearRecurrence[{402, -1},{1, 402},12] (* Ray Chandler, Aug 11 2015 *)

Formula

a(n) = 2*201*a(n-1) - a(n-2), n>=1, a(0)=1, a(-1):=0.
a(n) = S(n, 2*201)= U(n, 201), Chebyshev's polynomials of the second kind. See A049310.
G.f.: 1/(1-402*x+x^2).
a(n)= sum((-1)^k*binomial(n-k, k)*402^(n-2*k), k=0..floor(n/2)), n>=0.
a(n) = ((201+20*sqrt(101))^(n+1) - (201-20*sqrt(101))^(n+1))/(40*sqrt(101)), n>=0.
Showing 1-3 of 3 results.