login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

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
1, 1, 1, 1, 1, 5, 25, 169, 1, 205, 1225, 8569, 1, 10205, 61225, 428569, 1, 510205, 3061225, 21428569, 1, 25510205, 153061225, 1071428569, 1, 1275510205, 7653061225, 53571428569, 1, 63775510205, 382653061225, 2678571428569, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

Table of n, a(n) for n=0..32.

Index entries for linear recurrences with constant coefficients, signature (-1,-1,-1,50,50,50,50)

FORMULA

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

PROG

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)

CROSSREFS

Sequence in context: A181344 A134007 A125794 * A112242 A035341 A258369

Adjacent sequences:  A109790 A109791 A109792 * A109794 A109795 A109796

KEYWORD

nonn,easy

AUTHOR

Creighton Dement, Aug 14 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 12:43 EST 2019. Contains 329896 sequences. (Running on oeis4.)