cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A074544 a(n) = 2^n + 7^n + 8^n.

This page as a plain text file.
%I A074544 #16 Sep 08 2022 08:45:07
%S A074544 3,17,117,863,6513,49607,379857,2920823,22542273,174571847,1356218097,
%T A074544 10567263383,82560768033,646644832487,5076269600337,39931933631543,
%U A074544 314707907345793,2484430327803527,19642812107654577,155514083261753303
%N A074544 a(n) = 2^n + 7^n + 8^n.
%H A074544 Vincenzo Librandi, <a href="/A074544/b074544.txt">Table of n, a(n) for n = 0..200</a>
%H A074544 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (17,-86,112).
%F A074544 From _Mohammad K. Azarian_, Dec 28 2008: (Start)
%F A074544 G.f.: 1/(1-2*x) + 1/(1-7*x) + 1/(1-8*x).
%F A074544 E.g.f.: exp(2*x) + exp(7*x) + exp(8*x). (End)
%F A074544 a(n) = 17*a(n-1) - 86*a(n-2) + 112*a(n-3).
%t A074544 Table[2^n + 7^n + 8^n, {n, 0, 20}]
%o A074544 (Magma) [ 2^n + 7^n + 8^n: n in [0..30]]; // _Vincenzo Librandi_, Jun 13 2011
%Y A074544 Cf. A001550, A001576, A034513, A001579, A074501 - A074580.
%K A074544 easy,nonn
%O A074544 0,1
%A A074544 _Robert G. Wilson v_, Aug 23 2002