The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158408 a(n) = 900*n^2 - 2*n. 2
 898, 3596, 8094, 14392, 22490, 32388, 44086, 57584, 72882, 89980, 108878, 129576, 152074, 176372, 202470, 230368, 260066, 291564, 324862, 359960, 396858, 435556, 476054, 518352, 562450, 608348, 656046, 705544, 756842, 809940, 864838, 921536 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The identity (900*n - 1)^2 - (900*n^2 - 2*n)*30^2 = 1 can be written as A158409(n)^2 - a(n)*30^2 = 1. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..10000 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*(30^2*t-2)). Index entries for linear recurrences with constant coefficients, signature (3,-3,1). FORMULA G.f.: 2*x*(449 + 451*x)/(1-x)^3. - Bruno Berselli, Dec 08 2011 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Feb 12 2012 MATHEMATICA LinearRecurrence[{3, -3, 1}, {898, 3596, 8094}, 50] (* Vincenzo Librandi, Feb 12 2012 *) PROG (MAGMA) I:=[898, 3596, 8094]; [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 12 2012 (PARI) for(n=1, 40, print1(900*n^2 - 2*n", ")); \\ Vincenzo Librandi, Feb 12 2012 CROSSREFS Cf. A158409. Sequence in context: A145498 A252378 A210129 * A158409 A061044 A344595 Adjacent sequences:  A158405 A158406 A158407 * A158409 A158410 A158411 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Mar 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 22 12:43 EDT 2021. Contains 345380 sequences. (Running on oeis4.)