|
%I #52 Jul 12 2023 12:37:46
%S 1,29,841,24389,707281,20511149,594823321,17249876309,500246412961,
%T 14507145975869,420707233300201,12200509765705829,353814783205469041,
%U 10260628712958602189,297558232675799463481,8629188747598184440949
%N Powers of 29.
%C Same as Pisot sequences E(1, 29), L(1, 29), P(1, 29), T(1, 29). Essentially same as Pisot sequences E(29, 841), L(29, 841), P(29, 841), T(29, 841). 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 29-colored compositions of n such that no adjacent parts have the same color. - _Milan Janjic_, Nov 17 2011
%C Numbers n such that sigma(29*n) = 29*n + sigma(n). - _Jahangeer Kholdi_, Nov 23 2013
%H T. D. Noe, <a href="/A009973/b009973.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 (29).
%F G.f.: 1/(1-29*x). - _Philippe Deléham_, Nov 24 2008
%F a(n) = 29^n; a(n) = 29*a(n-1) for n>0, a(0)=1. - _Vincenzo Librandi_, Nov 21 2010
%F G.f.: (G(0)-2)/(9*x), where G(k)= 1 + 1/(1 - x*(9*k-9)/(x*(9*k+20) - 2/G(k+1))); (continued fraction). - _Sergei N. Gladkovskii_, Jun 17 2013
%p A009973:=n->29^n; seq(A009973(n), n=0..20); # _Wesley Ivan Hurt_, Jun 06 2014
%t 29^Range[0,20] (* _Harvey P. Dale_, Jul 19 2011 *)
%o (Sage) [29^n for n in (1..17)] # _Zerinvary Lajos_, Apr 29 2009
%o (Magma) [29^n: n in [0..30]]; // _Vincenzo Librandi_, Nov 21 2010
%o (Maxima) makelist(29^n, n, 0, 30); /* _Martin Ettl_, Nov 07 2012 */
%o (PARI) a(n)=29^n \\ _Charles R Greathouse IV_, Sep 24 2015
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, Dec 11 1996
|
