0,3

Were only the first few terms of the sequence taken into account, it would appear that the sequence consists only of 0 and powers of 2. Upon dividing out the powers of 2 from each term of the sequence, one sees that, actually, a(n) = c(n)*d(n) with c = (1, 1, -1, -1, 0, 1, 0, 0, 1, 1, 1, 1, 3, 1, 3, 3, 13, 19, 7, 41, 15, 11, 129, 189,) and d = (2^0, 2^0, 2, 2^2, 0, 2^4, 0, 0, 2^7, 2^8, 2^9, 2^(11), 2^(11), 2^(14), 2^(14), 2^(14), 2^(15), 2^(16), 2^(19), 2^(18), 2^(21), 2^(23), 2^(21), 2^(22),).

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

Floretion Algebra Multiplication Program, FAMP Code: 1basej[A*B] with A = + .5'i - .5'k + .5i' - .5k' - 2'jj' - .5'ij' - .5'ji' - .5'jk' - .5'kj' and B = + .5'i + .5'j + .5i' + .5j' + .5'kk' + .5'ij' + .5'ji' + .5e

Sequence in context: A052080 A073451 A078022 this_sequence A059057 A127511 A009170

Adjacent sequences: A106600 A106601 A106602 this_sequence A106604 A106605 A106606

easy,sign

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), May 10 2005