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!)
A158603 a(n) = 441*n^2 + 21. 2
21, 462, 1785, 3990, 7077, 11046, 15897, 21630, 28245, 35742, 44121, 53382, 63525, 74550, 86457, 99246, 112917, 127470, 142905, 159222, 176421, 194502, 213465, 233310, 254037, 275646, 298137, 321510, 345765, 370902, 396921, 423822, 451605, 480270, 509817, 540246 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
The identity (42*n^2 + 1)^2 - (441*n^2 + 21)*(2*n)^2 = 1 can be written as A158604(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.: -21*(1 + 19*x + 22*x^2)/(x-1)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
From Amiram Eldar, Mar 16 2023: (Start)
Sum_{n>=0} 1/a(n) = (coth(Pi/sqrt(21))*Pi/sqrt(21) + 1)/42.
Sum_{n>=0} (-1)^n/a(n) = (cosech(Pi/sqrt(21))*Pi/sqrt(21) + 1)/42. (End)
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {21, 462, 1785}, 50] (* Vincenzo Librandi, Feb 16 2012 *)
PROG
(Magma) I:=[21, 462, 1785]; [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 16 2012
(PARI) for(n=0, 40, print1(441*n^2 + 21", ")); \\ Vincenzo Librandi, Feb 16 2012
CROSSREFS
Sequence in context: A157014 A076552 A126996 * A307600 A025603 A296586
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 22 2009
EXTENSIONS
Comment rewritten, formula replaced by R. J. Mathar, Oct 28 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 March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)