I assume you are refering to the fact that the pattern changes when you change the number. I haven't determined exactly how to calculate the change, but it does not start over from the beginning, and it does not reset the counters. I have so far tested all the odd numbers through 109. Several of those have had only two bits changing. Also some sequences repeat after only twelve numbers. On Thu, 17 May 2012, Rob Clarke wrote: > What would really help me is wo things: > > Write a sequence of odd values with two bits set, like you did before only > this time switch the bit off for one write half way through a sequence of 1's > and again half way through a sequence of 0's. > > eg > 00000011 > 00000011 > 00000011 > 00000001 > 00000011 > 00000011 > 00000011 > 00000011 > 00000011 > > and > 0000001 > 0000001 > 0000001 > 0000101 > 0000001 > 0000001 > 0000001 > 0000001 > > Also, for writing a constant value, start with the sequences with just three > bits set. > > Cheers, > > Rob > > > Message was sent through the cbm-hackers mailing list > wlevak@sdf.lonestar.org SDF Public Access UNIX System - http://sdf.lonestar.org Message was sent through the cbm-hackers mailing listReceived on 2012-05-21 05:00:10
Archive generated by hypermail 2.2.0.