|
| |
| |
|
|
|
37, 73, 109, 145, 181, 217, 253, 289, 325, 361, 397, 433, 469, 505, 541, 577, 613, 649, 685, 721, 757, 793, 829, 865, 901, 937, 973, 1009, 1045, 1081, 1117, 1153, 1189, 1225, 1261, 1297, 1333, 1369, 1405, 1441, 1477, 1513, 1549, 1585, 1621
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The identity (36*n+1)^2-(36*n^2+2*n)*6^2 = 1 can be written as a(n)^2-A158064(n)*6^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*(6^2*t+2)).
|
|
|
FORMULA
| G.f.: x*(37-x)/(1-x)^2. - Vincenzo Librandi, Feb 11 2012
a(n) = 2*a(n-1)-a(n-2). - Vincenzo Librandi, Feb 11 2012
|
|
|
MATHEMATICA
| Range[37, 2000, 36] (* From Vladimir Joseph Stephan Orlovsky, Jun 15 2011 *)
LinearRecurrence[{2, -1}, {37, 73}, 50] (* Vincenzo Librandi, Feb 11 2012 *)
|
|
|
PROG
| (MAGMA) I:=[37, 73]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // Vincenzo Librandi, Feb 11 2012
(PARI) for(n=1, 40, print1(36*n + 1", ")); \\ Vincenzo Librandi, Feb 11 2012
|
|
|
CROSSREFS
| Cf. A158064.
Sequence in context: A178399 A044103 A044484 * A093838 A142100 A055604
Adjacent sequences: A158062 A158063 A158064 * A158066 A158067 A158068
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 12 2009
|
| |
|
|
