|
| |
| |
|
|
|
339, 677, 1015, 1353, 1691, 2029, 2367, 2705, 3043, 3381, 3719, 4057, 4395, 4733, 5071, 5409, 5747, 6085, 6423, 6761, 7099, 7437, 7775, 8113, 8451, 8789, 9127, 9465, 9803, 10141, 10479, 10817, 11155, 11493, 11831, 12169, 12507, 12845, 13183, 13521
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The identity (338*n+1)^2-(169*n^2+n)*(26)^2 = 1 can be written as a(n)^2-A173275(n)*26^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*(13^2*t+1)).
Index to sequences with linear recurrences with constant coefficients, signature (2,-1).
|
|
|
FORMULA
| G.f.: x*(339-x)/(1-x)^2. - Vincenzo Librandi, Feb 10 2012
a(n) = 2*a(n-1)-a(n-2). - Vincenzo Librandi, Feb 10 2012
|
|
|
MATHEMATICA
| LinearRecurrence[{2, -1}, {339, 677}, 50] (* Vincenzo Librandi, Feb 10 2012 *)
|
|
|
PROG
| (MAGMA) I:=[339, 677]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // Vincenzo Librandi, Feb 10 2012
(PARI) for(n=1, 50, print1(338*n + 1", ")); \\ Vincenzo Librandi, Feb 10 2012
|
|
|
CROSSREFS
| Cf. A173275.
Sequence in context: A035750 A186043 A107546 * A076748 A205223 A187383
Adjacent sequences: A157997 A157998 A157999 * A158001 A158002 A158003
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 14 2009
|
| |
|
|
