The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158393 676n - 1. 2
 675, 1351, 2027, 2703, 3379, 4055, 4731, 5407, 6083, 6759, 7435, 8111, 8787, 9463, 10139, 10815, 11491, 12167, 12843, 13519, 14195, 14871, 15547, 16223, 16899, 17575, 18251, 18927, 19603, 20279, 20955, 21631, 22307, 22983, 23659, 24335 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The identity (676*n-1)^2-(676*n^2-2*n)*(26)^2=1 can be written as a(n)^2-A158392(n)*(26)^2=1. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 Vincenzo Librandi, X^2-AY^2=1 E. J. Barbeau, Polynomial Excursions, Chapter 10: Diophantine equations (2010), pages 84-85 (row 15 in the first table at p. 85, case d(t) = t*(26^2*t-2)). Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = 2*a(n-1)-a(n-2). G.f.: x*(675+x)/(1-x)^2. MATHEMATICA LinearRecurrence[{2, -1}, {675, 1351}, 50] PROG (MAGMA) I:=[675, 1351]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; (PARI) a(n) = 676*n - 1. CROSSREFS Cf. A158392. Sequence in context: A158392 A264328 A124942 * A294949 A159208 A173134 Adjacent sequences:  A158390 A158391 A158392 * A158394 A158395 A158396 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Mar 18 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 26 17:22 EST 2020. Contains 331280 sequences. (Running on oeis4.)