A008591 Multiples of 9: a(n) = 9*n.
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
Offset: 0
Links
- Ivan Panchenko, Table of n, a(n) for n = 0..200
- CDLI, MKT 1, 039, HS 0217a
- INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 321
- Tanya Khovanova, Recursive Sequences
- Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
- Leo Tavares, Illustration: Triangular Frames
- Index entries for linear recurrences with constant coefficients, signature (2,-1).
Programs
-
Mathematica
Range[0, 1000, 9] (* Vladimir Joseph Stephan Orlovsky, May 27 2011 *)
-
Maxima
makelist(9*n,n,0,20); /* Martin Ettl, Dec 17 2012 */
-
PARI
a(n)=9*n \\ Charles R Greathouse IV, Jan 30 2012
Formula
From Vincenzo Librandi, Dec 24 2010: (Start)
a(n) = 9*n = 2*a(n-1) - a(n-2).
G.f.: 9x/(x-1)^2. (End)
E.g.f.: 9*x*exp(x). - Stefano Spezia, Oct 08 2022
Comments