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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111569 a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = -1, a(1) = 1, a(2) = 2, a(3) = 1. 5
-1, 1, 2, 1, 1, 4, 7, 9, 14, 25, 41, 64, 103, 169, 274, 441, 713, 1156, 1871, 3025, 4894, 7921, 12817, 20736, 33551, 54289, 87842, 142129, 229969, 372100, 602071, 974169, 1576238, 2550409, 4126649, 6677056, 10803703, 17480761, 28284466, 45765225 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

In reference to the program code given, 4*tesseq[A*H] = A001638 (a Fielder sequence) where A001638(2n)=L(n)^2. Here we have: a(2n+1) = A007598(n+1) = Fib(n+1)^2,

REFERENCES

Fielder, Daniel C.; Special integer sequences controlled by three parameters. Fibonacci Quart 6 1968 64-70.

LINKS

Robert Munafo, Sequences Related to Floretions

FORMULA

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

a(n) = 2*A056594(n+3)/5-6*A056594(n)/5+A000032(n+1)/5. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 12 2009]

PROG

Floretion Algebra Multiplication Program, FAMP Code: 4kbaseiseq[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, A111570, A111571, A111572, A111573, A007598, A000045.

Sequence in context: A141036 A011016 A096540 * A055130 A051292 A094424

Adjacent sequences:  A111566 A111567 A111568 * A111570 A111571 A111572

KEYWORD

easy,sign

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 4 12:08 EST 2012. Contains 204817 sequences.