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!)
A181679 a(n) = 121*n^2 + 2*n. 4
123, 488, 1095, 1944, 3035, 4368, 5943, 7760, 9819, 12120, 14663, 17448, 20475, 23744, 27255, 31008, 35003, 39240, 43719, 48440, 53403, 58608, 64055, 69744, 75675, 81848, 88263, 94920, 101819, 108960, 116343, 123968, 131835, 139944, 148295, 156888, 165723, 174800, 184119, 193680 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (121*n + 1)^2 - (121*n^2 + 2*n)*11^2 = 1 can be written as A158131(n)^2 - a(n)*11^2 = 1 (see Barbeau's paper in link).
Also, the identity (29282*n^2 + 484*n + 1)^2 - (121*n^2 + 2*n)*(2662*n + 22)^2 = 1 can be written as A157614(n)^2 - a(n)*A157613(n)^2 = 1. - Vincenzo Librandi, Feb 21 2012
This last formula is the case s=11 of the identity (2*s^4*n^2 + 4*s^2*n + 1)^2 - (s^2*n^2 + 2*n)*(2*s^3*n + 2*s)^2 = 1. - Bruno Berselli, Feb 21 2012
LINKS
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*(11^2*t+2)).
FORMULA
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: x*(-119*x - 123)/(x-1)^3.
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {123, 488, 1095}, 50]
PROG
(Magma) [ n*(121*n+2): n in [1..40] ];
(PARI) a(n) = n*(121*n+2).
CROSSREFS
Sequence in context: A091331 A248556 A031689 * A193251 A074303 A077379
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Nov 18 2010, Nov 19 2010
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 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)