login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109793 a(n) = - a(n-1) - a(n-2) - a(n-3) + 50*(n-4) + 50*a(n-5) + 50*a(n-6) + 50*a(n-7), n >= 8. 0

%I #11 Mar 13 2024 19:26:57

%S 1,1,1,1,1,5,25,169,1,205,1225,8569,1,10205,61225,428569,1,510205,

%T 3061225,21428569,1,25510205,153061225,1071428569,1,1275510205,

%U 7653061225,53571428569,1,63775510205,382653061225,2678571428569,1

%N a(n) = - a(n-1) - a(n-2) - a(n-3) + 50*(n-4) + 50*a(n-5) + 50*a(n-6) + 50*a(n-7), n >= 8.

%C Floretion Algebra Multiplication Program, FAMP Code: 2jessumseq[ + .25'i + .25i' + .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' + .25e], sumtype: (Y[15], *, inty*sum) (internal program code)

%H <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (-1,-1,-1,50,50,50,50)

%F G.f.: (-1+46*x^4-4*x^3-2*x+118*x^6+92*x^5-3*x^2)/((x+1)*(1+x^2)*(50*x^4-1)).

%K nonn,easy

%O 0,6

%A _Creighton Dement_, Aug 14 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:16 EDT 2024. Contains 371906 sequences. (Running on oeis4.)