|
%I #34 Sep 08 2022 08:44:29
%S 3,14,70,368,2002,11144,63010,360248,2076802,12050504,70290850,
%T 411802328,2421454402,14282991464,84472462690,500716911608,
%U 2973740844802,17689728038024,105375041354530,628434388600088
%N a(n) = 3^n + 5^n + 6^n.
%H Vincenzo Librandi, <a href="/A001579/b001579.txt">Table of n, a(n) for n = 0..300</a>
%H Henri W. Gould, <a href="http://www.fq.math.ca/Scanned/37-2/gould.pdf">The Girard-Waring power sum formulas for symmetric functions and Fibonacci sequences</a>, The Fibonacci Quarterly, 37(2):135-140, 1999.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (14,-63,90).
%F From _Mohammad K. Azarian_, Dec 26 2008: (Start)
%F G.f.: 1/(1-3*x) + 1/(1-5*x) + 1/(1-6*x).
%F E.g.f.: e^(3*x) + e^(5*x) + e^(6*x). (End)
%t Table[3^n + 5^n + 6^n, {n, 0, 20}]
%t LinearRecurrence[{14,-63,90},{3,14,70},20] (* _Harvey P. Dale_, Jun 17 2021 *)
%o (Magma) [3^n + 5^n + 6^n: n in [0..20]]; // _Vincenzo Librandi_, May 20 2011
%o (PARI) a(n)=3^n+5^n+6^n \\ _Charles R Greathouse IV_, Jun 10 2011
%o (Python)
%o def a(n): return 3**n + 5**n + 6**n
%o print([a(n) for n in range(20)]) # _Michael S. Branicky_, Mar 14 2021
%Y Cf. A001550, A001576, A034513, A074501-A074580.
%K easy,nonn
%O 0,1
%A _N. J. A. Sloane_
|
