login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A158741 a(n) = 1369*n^2 + 37. 2
37, 1406, 5513, 12358, 21941, 34262, 49321, 67118, 87653, 110926, 136937, 165686, 197173, 231398, 268361, 308062, 350501, 395678, 443593, 494246, 547637, 603766, 662633, 724238, 788581, 855662, 925481, 998038, 1073333, 1151366, 1232137, 1315646, 1401893, 1490878 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
The identity (74*n^2 + 1)^2 - (1369*n^2 + 37)*(2*n)^2 = 1 can be written as A158742(n)^2 - a(n)*A005843(n)^2 = 1.
LINKS
Vincenzo Librandi, X^2-AY^2=1, Math Forum, 2007. [Wayback Machine link]
FORMULA
G.f.: -37*(1 + 35*x + 38*x^2)/(x-1)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
From Amiram Eldar, Mar 23 2023: (Start)
Sum_{n>=0} 1/a(n) = (coth(Pi/sqrt(37))*Pi/sqrt(37) + 1)/74.
Sum_{n>=0} (-1)^n/a(n) = (cosech(Pi/sqrt(37))*Pi/sqrt(37) + 1)/74. (End)
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {37, 1406, 5513}, 50] (* Vincenzo Librandi, Feb 21 2012 *)
PROG
(Magma) I:=[37, 1406, 5513]; [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 21 2012
(PARI) for(n=0, 40, print1(1369*n^2 + 37", ")); \\ Vincenzo Librandi, Feb 21 2012
CROSSREFS
Sequence in context: A009981 A370334 A097315 * A094490 A231543 A279330
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)