A268727 One-based index of the toggled bit between n and A268717(n+1): a(n) = A070939(A003987(n,A268717(1+n))).

1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 7, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 8, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1

Offset: 0

Author

Antti Karttunen, Feb 13 2016

Keywords

• nonn
• base

Comments

A fractal sequence like A268726.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..8191

Crossrefs

One more than A268726.

Cf. A003188, A006068.

Cf. A001511, A003987, A010059, A070939, A101080, A268717.

Cf. also array A268833.

Programs

Scheme

(define (A268727 n) (A070939 (A003987bi n (A268717 (+ 1 n)))))  ;; A003987bi implements the bitwise-XOR, defined in A003987.

Formula

a(n) = A001511(1+A006068(n)).

a(n) = A070939(A003987(n,A268717(1+n))).

a(n) = 1 + floor(log_2(n XOR A003188(1+A006068(n)))).

a(n) = A001511(n)*(1-A010059(n)) + 1. - Alan Michael Gómez Calderón, Jun 15 2025