|
Search: id:A130853
|
|
|
| A130853 |
|
Runs of 1's of lengths 1, Fibonacci numbers F(1), F(2), F(3), ... (A000045) separated by 0's. |
|
+0
1
|
|
| 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Might be called a Fibonacci message.
|
|
EXAMPLE
|
Begin with 0. First Fibonacci number F(1)=1, so append 1's to 0 once - 01, append 0 - 010, F(2)=1, append 1's once and 0 - 01010, F(3)=2, we append two 1's and 0 - 01010110, ...
|
|
MAPLE
|
ts_Finonacci_zap:=proc(n) local i, j, tren, ans; ans := [ 0 ]: for i from 1 to n do tren := combinat[fibonacci](i): for j from 1 to tren do ans:=[ op(ans), 1 ]: od: ans:=[ op(ans), 0 ]: od; RETURN(ans) end: ts_Finonacci_zap(16);
|
|
CROSSREFS
|
Cf. A093521.
Adjacent sequences: A130850 A130851 A130852 this_sequence A130854 A130855 A130856
Sequence in context: A073445 A113217 A082446 this_sequence A115516 A071024 A090171
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jani Melik (jani_melik(AT)hotmail.com), Jul 21 2007
|
|
|
Search completed in 0.002 seconds
|
