0,7

A floretion-generated sequence which may be seen as the result of a certain sequence transform applied infinitely often. For a related case, see "Generalized Sequence Convergence?" link. This sequence is one of three related sequences, the others being A104770 and A104771. The FAMP program identity used was "jesright + jesleft = jes" where (a(n)) is associated with jesright, A104770 with jesleft, and A104771 with jes - an identity which has already been used several times to relate other sequences- examples include A001792, A023554, A104005, A099163, A005251 and A005901.

a(n+3) = a(n) - a(n+2); a(0) = 0, a(1) = -1, a(2) = 1; a(n+1) - a(n) = ((-1)^(n+1))*a(n+5); a(n) = ((-1)^n)*A050935(n+1) = ((-1)^n)*A078013(n+2); Apart from signs, essentially the same as A050935 ("When run backwards this gives a signed version of A000931"). FAMP result: a(n) = A104771(n) - A104770(n); Inversion gives (program Superseeker) match to A057597 (relating (a(n)) with Tribonacci numbers).

Floretion Algebra Multiplication Program, FAMP Code: 1jesrightforseq[A*B] with A = + .5'i + .5'j + .5'k + .5e and B = + .5'i + .5i' + .5'ii' + .5e; 1vesforseq[A*B] = A104770; ForType 1A. Alternative description: 1jesrightforseq[A*B]; LoopType: jes (infinitely iterated) or (a(n)) = jesloop(infty)-jesrightfor[A*B].

Cf. A050935, A104770, A104771, A078013, A000931, A057597.

Sequence in context: A036064 A090706 A050935 this_sequence A078013 A086461 A047089

Adjacent sequences: A104766 A104767 A104768 this_sequence A104770 A104771 A104772

sign,uned

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Mar 24 2005