|
| |
| |
|
|
|
66, 260, 582, 1032, 1610, 2316, 3150, 4112, 5202, 6420, 7766, 9240, 10842, 12572, 14430, 16416, 18530, 20772, 23142, 25640, 28266, 31020, 33902, 36912, 40050, 43316, 46710, 50232, 53882, 57660, 61566, 65600, 69762, 74052, 78470, 83016
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The identity (64*n+1)^2-(64*n^2+2*n)*8^2 = 1 can be written as A158071(n)^2-a(n)*8^2 = 1. - Vincenzo Librandi, Feb 11 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 15 in the first table at p. 85, case d(t) = t*(8^2*t+2)).
Index to sequences with linear recurrences with constant coefficients, signature (3,-3,1).
|
|
|
FORMULA
| a(0)=66, a(1)=260, a(2)=582, a(n)=3*a(n-1)-3*a(n-2)+a(n-3) [From Harvey P. Dale, Jul 25 2011]
G.f.: x*(66+62*x)/(1-x)^3. - Vincenzo Librandi, Feb 11 2012
|
|
|
MATHEMATICA
| Table[64n^2+2n, {n, 40}] (* or *) LinearRecurrence[{3, -3, 1}, {66, 260, 582}, 40] (* From Harvey P. Dale, Jul 25 2011 *)
|
|
|
PROG
| (MAGMA) I:=[66, 260, 582]; [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 11 2012
(PARI) for(n=1, 50, print1(64*n^2 + 2*n", ")); \\ Vincenzo Librandi, Feb 11 2012
|
|
|
CROSSREFS
| Cf. A158071.
Sequence in context: A205817 A046393 A117306 * A120102 A084027 A063249
Adjacent sequences: A158067 A158068 A158069 * A158071 A158072 A158073
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 2009
|
| |
|
|
