|
| |
| |
|
|
|
9, 19, 29, 39, 49, 59, 69, 79, 89, 99, 109, 119, 129, 139, 149, 159, 169, 179, 189, 199, 209, 219, 229, 239, 249, 259, 269, 279, 289, 299, 309, 319, 329, 339, 349, 359, 369, 379, 389, 399, 409, 419, 429, 439, 449, 459, 469, 479, 489, 499, 509, 519, 529, 539
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..5000
Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 979
|
|
|
FORMULA
| a(n) = 10*n+9; a(n) = 2*a(n-1) -a(n-2); [From Vincenzo Librandi, May 29 2011]
|
|
|
MATHEMATICA
| Range[9, 1000, 10] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 28 2011 *)
|
|
|
PROG
| (MAGMA) [10*n+9: n in [0..60]]; // Vincenzo Librandi, May 29 2011
|
|
|
CROSSREFS
| Cf. A008592, A017365, A190876.
Sequence in context: A088479 A043525 A031499 * A189798 A056126 A190513
Adjacent sequences: A017374 A017375 A017376 * A017378 A017379 A017380
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
