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.

A083315 a(n) = (2*5^n-(4^n-2^n))/2.

This page as a plain text file.
%I A083315 #7 Dec 31 2023 17:43:19
%S A083315 1,4,19,97,505,2629,13609,69997,357985,1822309,9241849,46731997,
%T A083315 235754065,1187152789,5969306089,29980723597,150440439745,
%U A083315 754349584069,3780337658329,18936047636797,94817676351025,474638135996149
%N A083315 a(n) = (2*5^n-(4^n-2^n))/2.
%C A083315 Binomial transform of A083314.
%H A083315 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (11,-38,40)
%F A083315 G.f.: (1-7*x+13*x^2)/((1-2*x)*(1-4*x)*(1-5*x)).
%F A083315 E.g.f.: (2*exp(5*x)-exp(4*x)+exp(2*x))/2.
%F A083315 a(n) = 11*a(n-1) - 38*a(n-2) + 40*a(n-3). - _Wesley Ivan Hurt_, Dec 31 2023
%Y A083315 Cf. A083314, A083316.
%K A083315 easy,nonn
%O A083315 0,2
%A A083315 _Paul Barry_, Apr 24 2003