%I A008591
%S A008591 0,9,18,27,36,45,54,63,72,81,90,99,108,117,126,135,144,
%T A008591 153,162,171,180,189,198,207,216,225,234,243,252,261,
%U A008591 270,279,288,297,306,315,324,333,342,351,360,369,378
%N A008591 Multiples of 9.
%C A008591 Complement of A168183; A168182(a(n)) = 0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Nov 30 2009]
%H A008591 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%H A008591 INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=321">
               Encyclopedia of Combinatorial Structures 321</a>
%p A008591 with(finance):seq(add(cashflows( [2,2,5], 0 ),k=1..n),n=0..42); - Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), Jun 21 2008
%o A008591 (Other) sage: [i for i in range(380) if gcd(i,9) == 9] # [From Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
%Y A008591 Sequence in context: A044894 A052484 A072830 this_sequence A070279 A016096 
               A070793
%Y A008591 Adjacent sequences: A008588 A008589 A008590 this_sequence A008592 A008593 
               A008594
%K A008591 nonn,new
%O A008591 0,2
%A A008591 N. J. A. Sloane (njas(AT)research.att.com).