|
| |
|
|
A110679
|
|
a(n+3) = 3*a(n+2) + 5*a(n+1) + a(n), a(0) = 1, a(1) = 2, a(2) = 11.
|
|
3
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| 2tesseq[A*B*cyc(A)] (see program code) gives an alternative formula for A110528.
|
|
|
LINKS
| Robert Munafo, Sequences Related to Floretions
|
|
|
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.
Sequence in context: A037744 A037625 A181270 * A127109 A054208 A120279
Adjacent sequences: A110676 A110677 A110678 * A110680 A110681 A110682
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 02 2005
|
|
|
EXTENSIONS
| Typo in program code fixed by Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Dec 11 2009
|
| |
|
|
