|
Search: id:A037011
|
|
|
| A037011 |
|
Baum-Sweet cubic sequence. |
|
+0
10
|
|
| 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Memo: more sequences like this should be added to the database.
|
|
REFERENCES
|
H. Niederreiter and M. Vielhaber, Tree complexity and a doubly ..., J. Complexity, 12 (1996), 187-198.
|
|
LINKS
|
J.-P. Allouche, Finite automata and arithmetic Seminaire Lotharingien de Combinatoire, B30c (1993), 23 pp. [Formerly: Publ. I.R.M.A. Strasbourg, 1993, 1993/034, p. 1-18.]
Michael Gilleland, Some Self-Similar Integer Sequences
D. P. Robbins, Cubic Laurent series in characteristic 2 with bounded partial quotients
|
|
FORMULA
|
G.f. satisfies A^3+x^(-1)*A+1 = 0 (mod 2).
It appears that a(n)=sum(k=0, n-1, C(n-1+k, n-1-k)*C(n-1, k)) modulo 2 = A082759(n-1) (mod 2). It appears also that a(k)=1 iff k/3 is in A003714. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 20 2003
|
|
MAPLE
|
A := x; for n from 1 to 100 do series(x+x*A^3+O(x^(n+2)), x, n+2); A := series(% mod 2, x, n+2); od: A;
|
|
CROSSREFS
|
Cf. A086747.
Sequence in context: A014135 A014054 A014099 this_sequence A024692 A079978 A164704
Adjacent sequences: A037008 A037009 A037010 this_sequence A037012 A037013 A037014
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
