This site is supported by donations to The OEIS Foundation.

 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

%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.

%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))

%o 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)

%K nonn

%O 0,6

%A Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 14 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 00:29 EDT 2013. Contains 225428 sequences.