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.

A097790 a(n)=5a(n-1)+C(n+3,3),n>0, a(0)=1.

This page as a plain text file.
%I A097790 #11 Aug 29 2024 21:09:24
%S A097790 1,9,55,295,1510,7606,38114,190690,953615,4768295,23841761,119209169,
%T A097790 596046300,2980232060,14901160980,74505805716,372529029549,
%U A097790 1862645148885,9313225745755,46566128730315,232830643653346
%N A097790 a(n)=5a(n-1)+C(n+3,3),n>0, a(0)=1.
%C A097790 Partial sums of A052244.
%H A097790 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (9,-26,34,-21,5).
%F A097790 G.f.: 1/((1-5*x)*(1-x)^4).
%F A097790 a(n) = 5^(n+4)/256-(32*n^3+312*n^2+1012*n+1107)/768.
%F A097790 a(n) = Sum_{k=0..n} binomial(n+4, k+4)*4^k.
%t A097790 nxt[{n_,a_}]:={n+1,5a+Binomial[n+4,3]}; NestList[nxt,{0,1},20][[All,2]] (* or *) LinearRecurrence[{9,-26,34,-21,5},{1,9,55,295,1510},30] (* _Harvey P. Dale_, Sep 20 2022 *)
%K A097790 easy,nonn
%O A097790 0,2
%A A097790 _Paul Barry_, Aug 24 2004