A126626 -id:A126626 - cp's OEIS frontend

A117154 Floretion with FAMP code 1teszapsumseq[C*B] with C = - .5'j + .5'k - .5j' + .5k' - 'ii' - .5'ij' - .5'ik' - .5'ji' - .5'ki' and B = - .5'i + .5'j - .5i' + .5j' - 'kk' - .5'ik' - .5'jk' - .5'ki' - .5'kj'.

1, 0, 0, 1, -1, 2, 0, 1, 0, 0, 1, -1, 2, -2, 1, -2, 0, -1, 0, 0, -1, 1, -2, 2, -3, 4, -2, 3, -2, 2, -1, 2, 0, 1, 0, 0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -4, 4, -3, 4, -2, 3, -2, 2, -1, 2, 0, 1, 0, 0, 1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 5, -6, 4, -5, 4, -4, 3, -4, 2, -3, 2, -2

Offset: 1

Creighton Dement, Apr 21 2006

The following parity property of this sequence seems interesting: Assume 0 is both positive and negative and let sgn(a(n)) be the sign of a(n). Then apparently sgn(a(n)) = -sgn(a(n+1)) = sgn(a(n+2)) for all n. But sgn(a(2n)) != sgn(a(2m)) for all n,m.

Creighton Dement, First 821 terms [after this it alternates 39, -39, 39, -39 forever]
Creighton Dement, Notes on A126626 and A117154
Creighton Dement, Floretions 2009, DRAFT. See section 4.1 Algorithms.
Index entries for linear recurrences with constant coefficients, signature (-1).

cp's OEIS Frontend

A117154 Floretion with FAMP code 1teszapsumseq[C*B] with C = - .5'j + .5'k - .5j' + .5k' - 'ii' - .5'ij' - .5'ik' - .5'ji' - .5'ki' and B = - .5'i + .5'j - .5i' + .5j' - 'kk' - .5'ik' - .5'jk' - .5'ki' - .5'kj'.

Views

Author

Keywords

Comments

Links