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!)
A158670 a(n) = 60*n^2 - 1. 2
59, 239, 539, 959, 1499, 2159, 2939, 3839, 4859, 5999, 7259, 8639, 10139, 11759, 13499, 15359, 17339, 19439, 21659, 23999, 26459, 29039, 31739, 34559, 37499, 40559, 43739, 47039, 50459, 53999, 57659, 61439, 65339, 69359, 73499, 77759, 82139, 86639, 91259, 95999 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (60*n^2 - 1)^2 - (900*n^2 - 30)*(2*n)^2 = 1 can be written as a(n)^2 - A158669(n)*A005843(n)^2 = 1.
LINKS
Vincenzo Librandi, X^2-AY^2=1, Math Forum, 2007. [Wayback Machine link]
FORMULA
G.f.: x*(-59 - 62*x + x^2)/(x-1)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
From Amiram Eldar, Mar 20 2023: (Start)
Sum_{n>=1} 1/a(n) = (1 - cot(Pi/(2*sqrt(15)))*Pi/(2*sqrt(15)))/2.
Sum_{n>=1} (-1)^(n+1)/a(n) = (cosec(Pi/(2*sqrt(15)))*Pi/(2*sqrt(15)) - 1)/2. (End)
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {59, 239, 539}, 50] (* Vincenzo Librandi, Feb 18 2012 *)
PROG
(Magma) I:=[59, 239, 539]; [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=1, 40, print1(60*n^2 - 1", ")); \\ Vincenzo Librandi, Feb 18 2012
CROSSREFS
Sequence in context: A059256 A158666 A060331 * A142046 A142952 A060263
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 24 2009
EXTENSIONS
Comment rewritten 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 12:32 EDT 2024. Contains 371969 sequences. (Running on oeis4.)