This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A008591 Multiples of 9. 55
 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; text; internal format)
 OFFSET 0,2 COMMENTS Complement of A168183; A168182(a(n)) = 0. - Reinhard Zumkeller, Nov 30 2009 a(n) = A007953(A002283(n)). - Reinhard Zumkeller, Aug 06 2010 An Iraqi tablet dating from the Middle Babylonian period (1400-1100 BC) gives a(1)-a(20), a(30), a(40), and a(50). See CDLI link for images and more information. - Charles R Greathouse IV, Jan 21 2017 Apart from 0, numbers whose digital root is 9. - Halfdan Skjerning, Mar 15 2018 LINKS Ivan Panchenko, Table of n, a(n) for n = 0..200 CDLI, MKT 1, 039, HS 0217a Tanya Khovanova, Recursive Sequences INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 321 Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015. Index entries for 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. - Vincenzo Librandi, Dec 24 2010 MATHEMATICA Range[0, 1000, 9] (* Vladimir Joseph Stephan Orlovsky, May 27 2011 *) PROG (PARI) a(n)=9*n \\ Charles R Greathouse IV, Jan 30 2012 (Maxima) makelist(9*n, n, 0, 20); /* Martin Ettl, Dec 17 2012 */ CROSSREFS Cf. A008588, A008589, A008590. Sequence in context: A264668 A052484 A072830 * A070279 A259729 A016096 Adjacent sequences:  A008588 A008589 A008590 * A008592 A008593 A008594 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 24 03:42 EST 2019. Contains 319412 sequences. (Running on oeis4.)