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!)
A158003 a(n) = 196*n^2 - n. 2
195, 782, 1761, 3132, 4895, 7050, 9597, 12536, 15867, 19590, 23705, 28212, 33111, 38402, 44085, 50160, 56627, 63486, 70737, 78380, 86415, 94842, 103661, 112872, 122475, 132470, 142857, 153636, 164807, 176370, 188325, 200672, 213411, 226542 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The identity (392*n - 1)^2 - (196*n^2 - n)*28^2 = 1 can be written as A158004(n)^2 - a(n)*28^2 = 1. - Vincenzo Librandi, Feb 10 2012
LINKS
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*(14^2*t-1)).
FORMULA
G.f.: x*(-195 - 197*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}, {195, 782, 1761}, 50] (* Vincenzo Librandi, Feb 10 2012 *)
PROG
(Magma) I:=[195, 782, 1761]; [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 10 2012
(PARI) for(n=1, 50, print1(196*n^2 - n", ")); \\ Vincenzo Librandi, Feb 10 2012
CROSSREFS
Cf. A158004.
Sequence in context: A080913 A343339 A157239 * A225713 A172354 A295130
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Mar 11 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 9 23:14 EDT 2024. Contains 372354 sequences. (Running on oeis4.)