|
| |
| |
|
|
|
101, 201, 301, 401, 501, 601, 701, 801, 901, 1001, 1101, 1201, 1301, 1401, 1501, 1601, 1701, 1801, 1901, 2001, 2101, 2201, 2301, 2401, 2501, 2601, 2701, 2801, 2901, 3001, 3101, 3201, 3301, 3401, 3501, 3601, 3701, 3801, 3901, 4001, 4101, 4201, 4301, 4401
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The identity (100*n+1)^2-(100*n^2+2*n)*10^2 = 1 can be written as a(n)^2-A158127(n)*10^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*(10^2*t+2)).
Index to sequences with linear recurrences with constant coefficients, signature (2,-1).
|
|
|
FORMULA
| G.f.: x*(101-x)/(1-x)^2. - Vincenzo Librandi, Feb 11 2012
a(n) = 2*a(n-1)-a(n-2). - Vincenzo Librandi, Feb 11 2012
|
|
|
MATHEMATICA
| LinearRecurrence[{2, -1}, {101, 201}, 50] (* Vincenzo Librandi, Feb 11 2012 *)
|
|
|
PROG
| (MAGMA) I:=[101, 201]; [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(100*n + 1", ")); \\ Vincenzo Librandi, Feb 11 2012
|
|
|
CROSSREFS
| Cf. A158127.
Sequence in context: A100775 A044333 A044714 * A162670 A134970 A081365
Adjacent sequences: A158125 A158126 A158127 * A158129 A158130 A158131
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 13 2009
|
| |
|
|
