0,6

Binomial transform of sequence (0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0). Note: the binomial transform of the sequence (0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0) is A111927; the binomial transform of the sequence (0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0) is A024495 (disregarding first two terms, which are both zero).

a(n+2) - a(n+1) + a(n) = A000295(n) = 2^n - n - 1 (Eulerian numbers); a(n) = 1/3*2^n-n+2/3*(1/2+1/2*I*sqrt(3))^n*(-1/4-1/4*I*sqrt(3))+2/3*(1/2-1/2*I*sqrt(3))^n*(-1/4+1/4*I*sqrt(3))

Floretion Algebra Multiplication Program, FAMP Code: -4ibaseisumseq[ + .5'i + .5'j + .5'k + .5'ij' + .5'jk' + .5'ki' + e], sumtype: Y[8] = (int)Y[6] - (int)Y[7] + Y[8] + sum (internal program code).

Cf. A000295, A111927, A024495.

Sequence in context: A144898 A053808 A163250 this_sequence A137609 A109818 A146797

Adjacent sequences: A111923 A111924 A111925 this_sequence A111927 A111928 A111929

easy,nonn

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 21 2005