|
%I #33 Jul 12 2023 12:44:57
%S 1,40,1600,64000,2560000,102400000,4096000000,163840000000,
%T 6553600000000,262144000000000,10485760000000000,419430400000000000,
%U 16777216000000000000,671088640000000000000,26843545600000000000000
%N Powers of 40.
%C Same as Pisot sequences E(1, 40), L(1, 40), P(1, 40), T(1, 40). Essentially same as Pisot sequences E(40, 1600), L(40, 1600), P(40, 1600), T(40, 1600). See A008776 for definitions of Pisot sequences.
%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 40-colored compositions of n such that no adjacent parts have the same color. - _Milan Janjic_, Nov 17 2011
%H T. D. Noe, <a href="/A009984/b009984.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 (40).
%F G.f.: 1/(1 - 40*x). - _Philippe Deléham_, Nov 24 2008
%F a(n) = 40^n; a(n) = 40*a(n-1) a(0) = 1. - _Vincenzo Librandi_, Nov 21 2010
%t 40^Range[0, 19] (* _Alonso del Arte_, Sep 04 2016 *)
%o (Magma) [40^n: n in [0..20]] // _Vincenzo Librandi_, Nov 21 2010
%o (PARI) a(n)=40^n \\ _Charles R Greathouse IV_, Jun 19 2015
%o (PARI) powers(40,10) \\ _Charles R Greathouse IV_, Jun 19 2015
%Y Cf. A000302 (powers of 4), A011557 (powers of 10).
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, Dec 11 1996
|
