|
| |
|
|
A008591
|
|
Multiples of 9.
|
|
33
| |
|
|
0, 9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 108, 117, 126, 135, 144, 153, 162, 171, 180, 189, 198, 207, 216, 225, 234, 243, 252, 261, 270, 279, 288, 297, 306, 315, 324, 333, 342, 351, 360, 369, 378, 387, 396, 405, 414, 423, 432, 441, 450, 459, 468, 477
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Complement of A168183; A168182(a(n)) = 0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2009]
a(n) = A007953(A002283(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 06 2010]
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 321
Index to sequences with linear recurrences with constant coefficients, signature (2,-1).
|
|
|
FORMULA
| a(n) = 9*n = 2*a(n-1)-a(n-2). G.f.: 9x/(x-1)^2. [From Vincenzo Librandi, Dec 24 2010]
|
|
|
MATHEMATICA
| Range[0, 1000, 9] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 27 2011 *)
|
|
|
PROG
| (PARI) a(n)=9*n \\ Charles R Greathouse IV, Jan 30 2012
|
|
|
CROSSREFS
| Cf. A008588, A008589, A008590.
Sequence in context: A044894 A052484 A072830 * A070279 A016096 A070793
Adjacent sequences: A008588 A008589 A008590 * A008592 A008593 A008594
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
