Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110679
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110679 a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 1, a(1) = 2, a(2) = 11. +0
4
1, 2, 11, 44, 189, 798, 3383, 14328, 60697, 257114, 1089155, 4613732, 19544085, 82790070, 350704367, 1485607536, 6293134513, 26658145586, 112925716859, 478361013020, 2026369768941, 8583840088782, 36361730124071 (list; graph; listen)
OFFSET

0,2

COMMENT

2tesseq[A*B*cyc(A)] (see program code) gives an alternative formula for A110528.

FORMULA

Program "FAMP" finds: 2*(-1^(n+1)) = A110528(n) - A001076(n+1) - 2*a(n). Program "Superseeker" finds: a(n) = A110526(n+1) - A110526(n); a(n) + a(n+1) = A033887(n+1)

MAPLE

seriestolist(series((-1+x)/((x+1)*(x^2+4*x-1)), x=0, 25)); -or- Floretion Algebra Multiplication Program, FAMP Code: 1jesseq[A*B*cyc(A)] with A = - 'j + 'k - 'ii' - 'ij' - 'ik' and B = - .5'i - .5i' - .5'ii' + .5'jj' - .5'kk' + .5'jk' + .5'kj' - .5e

CROSSREFS

Cf. A110528, A110680, A001076, A110526, A110526, A033887.

Adjacent sequences: A110676 A110677 A110678 this_sequence A110680 A110681 A110682

Sequence in context: A066058 A037744 A037625 this_sequence A127109 A054208 A120279

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 02 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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research