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!)
 A158732 a(n) = 68*n^2 + 1. 2
 1, 69, 273, 613, 1089, 1701, 2449, 3333, 4353, 5509, 6801, 8229, 9793, 11493, 13329, 15301, 17409, 19653, 22033, 24549, 27201, 29989, 32913, 35973, 39169, 42501, 45969, 49573, 53313, 57189, 61201, 65349, 69633, 74053, 78609, 83301, 88129 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The identity (68*n^2 + 1)^2 - (1156*n^2 + 34)*(2*n)^2 = 1 can be written as a(n)^2 - A158731(n)*A005843(n)^2 = 1. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..10000 Vincenzo Librandi, X^2-AY^2=1 Index entries for linear recurrences with constant coefficients, signature (3,-3,1). FORMULA a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). G.f.: -(1 + 66*x + 69*x^2)/(x-1)^3. MATHEMATICA LinearRecurrence[{3, -3, 1}, {1, 69, 273}, 50] (* Vincenzo Librandi, Feb 18 2012 *) 68*Range[0, 40]^2+1 (* Harvey P. Dale, Sep 16 2019 *) PROG MAGMA) I:=[1, 69, 273]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..40]]; // Vincenzo Librandi, Feb 18 2012 (PARI) for(n=0, 40, print1(68*n^2 + 1", ")); \\ Vincenzo Librandi, Feb 18 2012 CROSSREFS Cf. A005843, A158732. Sequence in context: A183447 A296126 A188546 * A069216 A158736 A262456 Adjacent sequences:  A158729 A158730 A158731 * A158733 A158734 A158735 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Mar 25 2009 EXTENSIONS Comment rewritten, a(0) added and formula replaced by R. J. Mathar, Oct 22 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 May 17 05:13 EDT 2021. Contains 343965 sequences. (Running on oeis4.)