The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A157511 a(n) = 5000*n^2 + 200*n + 1. 3
5201, 20401, 45601, 80801, 126001, 181201, 246401, 321601, 406801, 502001, 607201, 722401, 847601, 982801, 1128001, 1283201, 1448401, 1623601, 1808801, 2004001, 2209201, 2424401, 2649601, 2884801, 3130001, 3385201, 3650401 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (5000*n^2 + 200*n + 1)^2 - (25*n^2 + n)*(1000*n + 20)^2 = 1 can be written as a(n)^2 - A173089(n)*A157510(n)^2 = 1 (see also second part of the comment at A173089). - Vincenzo Librandi, Feb 04 2012
LINKS
Vincenzo Librandi, X^2-AY^2=1
FORMULA
From Harvey P. Dale, May 24 2011: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(1)=5201, a(2)=20401, a(3)=45601.
G.f.: -x*((5201 + x*(4798+x))/(x-1)^3). (End)
MATHEMATICA
Table[5000n^2+200n+1, {n, 40}] (* or *) LinearRecurrence[{3, -3, 1}, {5201, 20401, 45601}, 40] (* Harvey P. Dale, May 24 2011 *)
PROG
(Magma) I:=[5201, 20401, 45601]; [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 04 2012
(PARI) for(n=1, 40, print1(5000*n^2 + 200*n + 1", ")); \\ Vincenzo Librandi, Feb 04 2012
CROSSREFS
Sequence in context: A262909 A093071 A247266 * A165599 A109159 A231113
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 02 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 May 24 11:32 EDT 2024. Contains 372773 sequences. (Running on oeis4.)