This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173141 a(n) = 49*n^2 + n. 2
 50, 198, 444, 788, 1230, 1770, 2408, 3144, 3978, 4910, 5940, 7068, 8294, 9618, 11040, 12560, 14178, 15894, 17708, 19620, 21630, 23738, 25944, 28248, 30650, 33150, 35748, 38444, 41238, 44130, 47120, 50208, 53394, 56678, 60060, 63540, 67118, 70794, 74568, 78440, 82410, 86478, 90644, 94908, 99270, 103730, 108288 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The identity (98*n+1)^2-(49*n^2+n)*(14)^2 = 1 can be written as A157947(n)^2-a(n)*14^2 = 1. - Vincenzo Librandi, Feb 10 2012 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 14 in the first table at p. 85, case d(t) = t*(7^2*t+1)). Index entries for linear recurrences with constant coefficients, signature (3,-3,1). FORMULA G.f.: x*(-50-48*x)/(x-1)^3. - Vincenzo Librandi, Feb 10 2012 a(n) = 3*a(n-1) -3*a(n-2) +a(n-3). - Vincenzo Librandi, Feb 10 2012 MATHEMATICA LinearRecurrence[{3, -3, 1}, {50, 198, 444}, 50] (* Vincenzo Librandi, Feb 10 2012 *) Table[49n^2+n, {n, 50}] (* Harvey P. Dale, Aug 22 2015 *) PROG (MAGMA) [ 49*n^2+n: n in [1..50] ]; (PARI) for(n=1, 50, print1(49*n^2 + n", ")); \\ Vincenzo Librandi, Feb 10 2012 CROSSREFS Cf. A157947. Sequence in context: A244701 A180293 A031692 * A115592 A273293 A097371 Adjacent sequences:  A173138 A173139 A173140 * A173142 A173143 A173144 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Nov 22 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 23:39 EDT 2019. Contains 328211 sequences. (Running on oeis4.)