The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A009974 Powers of 30. 4

%I

%S 1,30,900,27000,810000,24300000,729000000,21870000000,656100000000,

%T 19683000000000,590490000000000,17714700000000000,531441000000000000,

%U 15943230000000000000,478296900000000000000,14348907000000000000000

%N Powers of 30.

%C The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 1, a(n) equals the number of 30-colored compositions of n such that no adjacent parts have the same color. - _Milan Janjic_, Nov 17 2011

%H T. D. Noe, <a href="/A009974/b009974.txt">Table of n, a(n) for n = 0..100</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (30).

%F G.f.: 1/(1-30*x). - _Philippe DelĂ©ham_, Nov 24 2008

%F a(n) = 30^n; a(n) = 30*a(n-1), n > 0; a(0)=1. - _Vincenzo Librandi_, Nov 21 2010

%o (Sage) [lucas_number1(n,30,0) for n in range(1, 17)] # _Zerinvary Lajos_, Apr 29 2009

%o (MAGMA)[30^n: n in [0..100]] // _Vincenzo Librandi_, Nov 21 2010

%o (PARI) a(n)=30^n \\ _Charles R Greathouse IV_, Jun 19 2015

%o (PARI) powers(30,12) \\ _Charles R Greathouse IV_, Jun 19 2015

%Y Row 7 of A329332.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

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 May 14 16:17 EDT 2021. Contains 343884 sequences. (Running on oeis4.)