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.

A173657 2+2^n+3^n.

This page as a plain text file.
%I A173657 #20 Apr 23 2022 22:17:08
%S A173657 4,7,15,37,99,277,795,2317,6819,20197,60075,179197,535539,1602517,
%T A173657 4799355,14381677,43112259,129271237,387682635,1162785757,3487832979,
%U A173657 10462450357,31385253915,94151567437,282446313699,847322163877,2541932937195,7625731702717
%N A173657 2+2^n+3^n.
%C A173657 Sum of the n-th powers of the first 5 Fibonacci numbers A000045(0..4).
%H A173657 <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (6,-11,6).
%F A173657 a(n)= 6*a(n-1)-11*a(n-2)+6*a(n-3).
%F A173657 a(n) = 1+A001550(n).
%F A173657 G.f.: ( -4+17*x-17*x^2 ) / ( (x-1)*(3*x-1)*(2*x-1) ).
%p A173657 with(combinat):f:=n-> sum(fibonacci(k)^n,k=0..4):seq(f(n),n=1..20);
%t A173657 Table[2+2^n+3^n,{n,0,40}] (* or *) LinearRecurrence[{6,-11,6},{4,7,15},40](* _Harvey P. Dale_, Jun 08 2011 *)
%Y A173657 Cf. A075996 (primes), A007689.
%K A173657 nonn,easy
%O A173657 0,1
%A A173657 _Gary Detlefs_, Nov 24 2010
%E A173657 More terms from _Harvey P. Dale_, Jun 08 2011