

A108930


A floretiongenerated sequence calculated using the rules given for A108618 with initial seed x = + .25'i + .25'k + .25i'  .5j' + .75k'  .25'ij'  .25'ji'  .25'jk' + .25'kj'  .5e; version: basek.


0



3, 0, 0, 2, 1, 0, 2, 1, 1, 2, 0, 1, 3, 1, 3, 0, 0, 1, 3, 3, 4, 5, 2, 6, 9, 1, 3, 5, 1, 0, 1, 1, 5, 3, 1, 8, 4, 2, 8, 2, 2, 6, 1, 2, 5, 0, 3, 5, 1, 2, 4, 2, 2, 0, 4, 1, 4, 6, 3, 8, 7, 4, 8, 5, 6, 7, 3, 7, 6, 3, 8, 8, 2, 8, 8, 4, 6, 5, 4, 4, 3, 3, 1, 0, 3, 2, 1, 3, 3, 2, 5, 6, 4, 6, 8, 5, 6, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

"Version: basek" in the name field is a reference to the floretion k'. It means that in order to calculate a(n), the rule given for A108618: "a(n) is given by twice the coefficient of e (the unit) in y from step 4 inside of the nth loop." should be replaced by "a(n) is given by 4 times the coefficient of k' in y from step 4 inside of the nth loop." This sequence appears to be unbounded. Moreover, (a(n)) produces a "spiral" when plotted against sequences from the same batch (i.e. against versions: tes, ves etc.). Raytraced plots similar to the one given in the link can be formed using this sequence (for example). (a(n)) appears to become more "predictable" with increasing n. For n in the range from 987 to 1000 we have: a(987) = 59, a(988) = 112, a(989) = 52, a(990) = 55, a(991) = 108, a(992) = 51, a(993) = 53, a(994) = 109, a(995) = 55, a(996) = 51, a(997) = 107, a(998) = 54, a(999) = 50, a(1000) = 109


LINKS

Table of n, a(n) for n=0..97.
C. Dement, Floretion Online Multiplier. [broken link?]


PROG

Floretion Algebra Multiplication Program, FAMP Code: 4baseksumseq[(+ .5'i  .25'j + .25'k + .5i'  .25j' + .25k'  .5'ii'  .25'ij'  .25'ik'  .25'ji'  .25'ki'  .5e)(+ .5'i + .5j' + .5'ij' + .5e)] Sumtype is set to: sum[Y[15]] = sum[ * ]


CROSSREFS

Cf. A108618.
Sequence in context: A099475 A120569 A128113 * A059682 A156548 A112883
Adjacent sequences: A108927 A108928 A108929 * A108931 A108932 A108933


KEYWORD

easy,sign


AUTHOR

Creighton Dement, Jul 26 2005


STATUS

approved



