A318925 a(n) = A175046(A318921(n)).

0, 0, 0, 3, 0, 0, 3, 7, 0, 0, 0, 3, 12, 3, 7, 15, 0, 0, 0, 3, 0, 0, 3, 7, 24, 12, 3, 7, 28, 7, 15, 31, 0, 0, 0, 3, 0, 0, 3, 7, 0, 0, 0, 3, 12, 3, 7, 15, 48, 24, 12, 51, 12, 3, 7, 15, 56, 28, 7, 15, 60, 15, 31, 63, 0, 0, 0, 3, 0, 0, 3, 7, 0, 0, 0, 3, 12, 3, 7

Offset

0,4

Comments

Inspired by Andrew Weimholt's observation that A318921(A175046(n)) = A001477(n).

As in A318921, the empty string is represented by 0.

a(n) = n iff every run in the binary expansion of n has length at least 2, and otherwise a(n) < n.

Links

Rémy Sigrist, Table of n, a(n) for n = 0..16384

Crossrefs

Cf. A318921, A175046, A001477.

Sequence in context: A337981 A341761 A181787 * A285213 A285339 A344931

Adjacent sequences: A318922 A318923 A318924 * A318926 A318927 A318928

Keyword

nonn,look,hear,base

Author

N. J. A. Sloane, Sep 09 2018

Extensions

More terms from Rémy Sigrist, Sep 09 2018

Status

approved