A178748 -id:A178748 - cp's OEIS frontend

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

David Scambler, Jun 08 2010

A simple scatter plot reveals a self-similar structure that resembles flying geese.
Ignoring the initial zero term, split the sequence into rows of increasing binary magnitude such that the terms in row m satisfy 2^m <= a(n) < 2^(m+1).
0: 1,
1: 3,
2: 6,6,7,
3: 13,12,12,13,15,
4: 26,26,27,25,24,24,25,27,30,30,31,
5: 53,52,52,53,55,50,50,51,49,48,48,49,51,54,54,55,61,60,60,61,63,
Then,
Row m starts at n = A005578(m+1) in the original sequence
The first term in row m is A081254(m)
The last term in row m is 2^(m+1)-1
The number of terms in row m is A001045(m+1)
The number of distinct terms in row m is A005578(m)
The number of ascending runs in row m is A005578(m)
The number of non-ascending runs in row m is A005578(m)
The number of descending runs in row m is A052950(m)
The number of non-descending runs in row m is A005578(m-1)
The sum of terms in row m is A178747(m)
The total number of '1' bits in the terms of row n is A178748(m)

			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

D. Scambler, Table of n, a(n) for n = 0..1024

Cf. A178747 sum of terms in rows of a(n), A178748 total number of '1' bits in the terms of rows of a(n).

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

If n is a power of 2, a(n) = n*3/2. Lim(a(n)/n) = 3/2.

A178747 Sum of terms in 'rows' of A178746.

Original entry on oeis.org

1, 3, 19, 65, 295, 1129, 4663, 18441, 74359, 296585, 1188727, 4751497, 19015543, 76048521, 304232311, 1216874633, 4867651447, 19470387337, 77882161015, 311527770249, 1246113527671, 4984450615433, 19937812248439, 79751235012745, 319004979197815, 1276019860867209

Offset: 0

David Scambler, Jun 09 2010

nonn

			a(0) = 1, a(1) = 3, a(2) = 6 + 6 + 7 = 19.

Andrew Howroyd, Table of n, a(n) for n = 0..500

Cf. A178748 (sum of '1' bits in rows of A178746).

Cf. A001045, A081254, A138238.

seq(n)={my(a=vector(n+1), f=0, p=0, k=1, s=0); while(k<=#a, my(b=bitxor(p+1,p)); f=bitxor(f,b); p=bitxor(p, bitand(b,f)); if(p>2^k, a[k]=s; k++; s=0); s+=p); a} \\ Andrew Howroyd, Mar 03 2020

a(n) = {(17*4^n + 5*(2*(-1)^n-1)*2^n - 7*(-1)^n)/15} \\ Andrew Howroyd, Mar 03 2020

G.f: (1/4)*x^3 - (1/8)*x^2 - 1/16 + (x^4 + (3/4)*x^3 - (1/2)*x^2 - (3/16)*x + 1/16)*F(x) = 0. [From GUESSS]
From David Scambler, Jun 17 2010: (Start)
a(n) = (17*4^n + 5*(2*(-1)^n-1)*2^n - 7*(-1)^n)/15.
a(n) = A001045(n+1) * A081254(n+1) + (-1)^n * A138238(n-1).
(End)

Terms a(16) and beyond from Andrew Howroyd, Mar 03 2020

cp's OEIS Frontend

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A178747 Sum of terms in 'rows' of A178746.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions