|
Search: id:A039963
|
|
| |
|
| 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
An example of a d-perfect sequence.
Motzkin numbers mod 2. - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 23 2004
Let {a, b, c, c, a, b, a, b, a, b, c, c, a, b, ...} be the fixed point of the morphism : a -> ab, b -> cc, c -> ab, starting from a; then the sequence is obtained by taking a = 1, b = 1, c = 0. - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Mar 28 2004
|
|
LINKS
|
D. Kohel, S. Ling and C. Xing, Explicit Sequence Expansions
D. Kohel, S. Ling and C. Xing, Explicit Sequence Expansions
|
|
FORMULA
|
a(n)=A035263(1+floor(n/2)). - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 23 2004
a(n) = A040039(n) mod 2 = A002212(n+1) mod 2 . a(0) = a(1) = 1, for n>=2 : a(n) = ( a(n) + sum_{k= 0, (n-2)} a(k)*a(n-2-k)) mod 2 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Mar 26 2004
a(n) = (A(n+2) - A(n)) mod 2, for A = A019300, A001285, A010060, A010059, A000069, A001969. - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Mar 28 2004
a(n) = A001006(n) mod 2 = A092444(n) - Christian G. Bower (bowerc(AT)usa.net), Jun 12 2005
|
|
MATHEMATICA
|
Flatten[ Nest[ Function[l, {Flatten[(l /. {a -> {a, b}, b -> {c, c}, c -> {a, b}})]}], {a}, 7] /. {a -> {1}, b -> {1}, c -> {0}}] (from Robert G. Wilson v Feb 26 2005)
|
|
CROSSREFS
|
Cf. A081706.
Adjacent sequences: A039960 A039961 A039962 this_sequence A039964 A039965 A039966
Sequence in context: A068432 A134668 A092444 this_sequence A058840 A036987 A143259
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Christian G. Bower (bowerc(AT)usa.net), Jun 12 2005
Edited by njas at the suggestion of Andrew Plewe and Ralf Stephan, Jul 13 2007
|
|
|
Search completed in 0.002 seconds
|