|
Search: id:A082410
|
|
|
| A082410 |
|
a(1)=0 and a(n) is built with the rule: for any k>=0, if a(1),a(2),......,a(2^k+1) are known next 2^k terms are given as follows: a(2k^+1+i)=1-a(2^k+1-i) for 1<=i<=2^k |
|
+0
4
|
|
| 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It seems that a(n) is A014577 shifted right twice.
Complement of characteristic function of A060833.
|
|
FORMULA
|
n>=2 sum(k=1, n, a(k))=(n+A037834(n-1))/2
|
|
EXAMPLE
|
3 first terms are 0,1,1 therefore a(4)=a(3+1)=1-a(3-1)=1-a(2)=0, a(5)=a(3+2)=1-a(3-2)=1-a(1)=1 and sequence begins 0,1,1,0,1,...
|
|
CROSSREFS
|
Sequence in context: A103226 A080886 A083924 this_sequence A094217 A092220 A011655
Adjacent sequences: A082407 A082408 A082409 this_sequence A082411 A082412 A082413
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 24 2003
|
|
|
Search completed in 0.002 seconds
|
