|
Search: id:A095907
|
|
|
| A095907 |
|
Digits in the concatenation of strings formed from a previous string by substituting "01" for "0" and "011" for "1" simultaneously at each occurrence. Start with [0]. |
|
+0
1
|
|
| 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
C. Long, A strange recursive sequence
|
|
FORMULA
|
a(n)=1 if n = floor(phi*m) or a(n)=0 if n = floor(phi^2*m), for some positive integer m; a(0)=0 (phi denotes the golden ratio: (1 + sqrt(5))/2). a(0)=0; a(n)=1 if n belongs to A000201 (Lower Wythoff sequence) or 0 if n belongs to A001950 (Upper Wythoff sequence).
|
|
EXAMPLE
|
0->01->01011->0101101011011->0101101011011010110101101101011011->... and then juxtapose: 0010101101011010110110101101011011010110101101101011011...
|
|
PROGRAM
|
(PARI) v=[0]; for(n=1, 5, w=[]; for(k=1, length(v), if(v[k]==0, w=concat(w, [0, 1]), w=concat(w, [0, 1, 1]))); v=w; for(l=1, length(v), print1(v[l], ", ")))
|
|
CROSSREFS
|
Adjacent sequences: A095904 A095905 A095906 this_sequence A095908 A095909 A095910
Sequence in context: A072629 A022925 A051840 this_sequence A056051 A143541 A090173
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 13 2004
|
|
|
Search completed in 0.002 seconds
|
