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!)
A158127 a(n) = 100*n^2 + 2*n. 2
102, 404, 906, 1608, 2510, 3612, 4914, 6416, 8118, 10020, 12122, 14424, 16926, 19628, 22530, 25632, 28934, 32436, 36138, 40040, 44142, 48444, 52946, 57648, 62550, 67652, 72954, 78456, 84158, 90060, 96162, 102464, 108966, 115668, 122570 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (100*n + 1)^2 - (100*n^2 + 2*n)*10^2 = 1 can be written as A158128(n)^2 - a(n)*10^2 = 1. - Vincenzo Librandi, Feb 11 2012
LINKS
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*(10^2*t+2)).
FORMULA
G.f.: x*(102 + 98*x)/(1-x)^3. - Vincenzo Librandi, Feb 11 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Feb 11 2012
MATHEMATICA
Table[100n^2 +2n, {n, 45}] (* Harvey P. Dale, Mar 15 2011 *)
LinearRecurrence[{3, -3, 1}, {102, 404, 906}, 50] (* Vincenzo Librandi, Feb 11 2012 *)
PROG
(Magma) I:=[102, 404, 906]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // Vincenzo Librandi, Feb 11 2012
(PARI) for(n=1, 50, print1(100*n^2 + 2*n", ")); \\ Vincenzo Librandi, Feb 11 2012
CROSSREFS
Cf. A158128.
Sequence in context: A127655 A206659 A206652 * A231361 A263117 A263113
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 13 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 21 07:02 EDT 2024. Contains 372729 sequences. (Running on oeis4.)