A178746 Binary counter with intermittent bits. Starting at zero the counter attempts to increment by 1 at each step but each bit in the counter alternately accepts and rejects requests to toggle.
0, 1, 3, 6, 6, 7, 13, 12, 12, 13, 15, 26, 26, 27, 25, 24, 24, 25, 27, 30, 30, 31, 53, 52, 52, 53, 55, 50, 50, 51, 49, 48, 48, 49, 51, 54, 54, 55, 61, 60, 60, 61, 63, 106, 106, 107, 105, 104
Offset: 0
Examples
0 -> low bit toggles -> 1 -> should be 2 but low bit does not toggle -> 3 -> should be 4 but 2nd-lowest bit does not toggle -> 6 -> should be 7 but low bit does not toggle -> 6 -> low bit toggles -> 7
Links
- D. Scambler, Table of n, a(n) for n = 0..1024
Crossrefs
Programs
-
PARI
seq(n)={my(a=vector(n+1), f=0, p=0); for(i=2, #a, my(b=bitxor(p+1,p)); f=bitxor(f,b); p=bitxor(p, bitand(b,f)); a[i]=p); a} \\ Andrew Howroyd, Mar 03 2020
Formula
If n is a power of 2, a(n) = n*3/2. Lim(a(n)/n) = 3/2.
Comments