

A130716


a(0)=a(1)=a(2)=1, a(n)=0 for n>2.


10



1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

With different signs this sequence is the convolutional inverse of the Fibonacci sequence: 1, 1, 1, 0, 0, ...  Tanya Khovanova, Jul 14 2007


LINKS



FORMULA

Given g.f. A(x), then B(a) = A(q) / q satisfies 0 = f(B(q), B(q^2)) where f(u, v) = v  u * (u  2).  Michael Somos, Oct 22 2013
Euler transform of length 3 sequence [ 1, 0, 1].  Michael Somos, Oct 22 2013
G.f. is third cyclotomic polynomial.
G.f.: (1  x^3) / (1  x).


EXAMPLE

G.f. = 1 + x + x^2.
G.f. = 1/q + 1 + q.


MATHEMATICA



PROG



CROSSREFS



KEYWORD

easy,nonn


AUTHOR



STATUS

approved



