login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111574 a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4. 2
1, -1, 2, 3, 3, 4, 9, 15, 22, 35, 59, 96, 153, 247, 402, 651, 1051, 1700, 2753, 4455, 7206, 11659, 18867, 30528, 49393, 79919, 129314, 209235, 338547, 547780, 886329, 1434111, 2320438, 3754547, 6074987, 9829536, 15904521, 25734055, 41638578, 67372635 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

See comment and FAMP code for A111569.

LINKS

Table of n, a(n) for n=0..39.

FORMULA

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

MATHEMATICA

LinearRecurrence[{1, 0, 1, 1}, {1, -1, 2, 3}, 40] (* Harvey P. Dale, Jan 24 2017 *)

PROG

Floretion Algebra Multiplication Program, FAMP Code: -4baseiseq[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, A111570, A111571, A111572, A111573, A111575, A111576.

Sequence in context: A263775 A206455 A227263 * A330510 A173590 A128744

Adjacent sequences:  A111571 A111572 A111573 * A111575 A111576 A111577

KEYWORD

easy,sign

AUTHOR

Creighton Dement, Aug 10 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 11:58 EST 2020. Contains 338900 sequences. (Running on oeis4.)