Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111570
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111570 a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4. +0
6
2, 5, 4, 7, 14, 23, 34, 55, 92, 149, 238, 385, 626, 1013, 1636, 2647, 4286, 6935, 11218, 18151, 29372, 47525, 76894, 124417, 201314, 325733, 527044, 852775, 1379822, 2232599, 3612418, 5845015, 9457436, 15302453, 24759886 (list; graph; listen)
OFFSET

0,1

COMMENT

See comment and FAMP code for A111569.

FORMULA

G.f. (-2-3*x+x^2-x^3)/((1+x^2)*(x^2+x-1))

PROGRAM

Floretion Algebra Multiplication Program, FAMP Code: 1vesseq[B+H] with B = - .25'i + .25'j - .25i' + .25j' + k' - .5'kk' - .25'ik' - .25'jk' - .25'ki' - .25'kj' - .5e and H = + .75'ii' + .75'jj' + .75'kk' + .75e

CROSSREFS

Cf. A001638, A111569, A111571, A111572, A111573, A007598, A000045.

Adjacent sequences: A111567 A111568 A111569 this_sequence A111571 A111572 A111573

Sequence in context: A036237 A015948 A119733 this_sequence A057954 A155896 A060710

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 10 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 November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research