A001579 a(n) = 3^n + 5^n + 6^n.

3, 14, 70, 368, 2002, 11144, 63010, 360248, 2076802, 12050504, 70290850, 411802328, 2421454402, 14282991464, 84472462690, 500716911608, 2973740844802, 17689728038024, 105375041354530, 628434388600088

Offset

0,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..300

Henri W. Gould, The Girard-Waring power sum formulas for symmetric functions and Fibonacci sequences, The Fibonacci Quarterly, 37(2):135-140, 1999.

Index entries for linear recurrences with constant coefficients, signature (14,-63,90).

Formula

From Mohammad K. Azarian, Dec 26 2008: (Start)

G.f.: 1/(1-3*x) + 1/(1-5*x) + 1/(1-6*x).

E.g.f.: e^(3*x) + e^(5*x) + e^(6*x). (End)

Mathematica

Table[3^n + 5^n + 6^n, {n, 0, 20}]
LinearRecurrence[{14, -63, 90}, {3, 14, 70}, 20] (* Harvey P. Dale, Jun 17 2021 *)

Prog

(Magma) [3^n + 5^n + 6^n: n in [0..20]]; // Vincenzo Librandi, May 20 2011
(PARI) a(n)=3^n+5^n+6^n \\ Charles R Greathouse IV, Jun 10 2011
(Python)
def a(n): return 3**n + 5**n + 6**n
print([a(n) for n in range(20)]) # Michael S. Branicky, Mar 14 2021

Crossrefs

Cf. A001550, A001576, A034513, A074501-A074580.

Sequence in context: A261207 A161939 A270598 * A327871 A006772 A320421

Adjacent sequences: A001576 A001577 A001578 * A001580 A001581 A001582

Keyword

easy,nonn

Author

N. J. A. Sloane

Status

approved