Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109793
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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; listen)
OFFSET

0,6

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

PROGRAM

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: A144887 A134007 A125794 this_sequence A112242 A035341 A137383

Adjacent sequences: A109790 A109791 A109792 this_sequence A109794 A109795 A109796

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research