A265339 -id:A265339 - cp's OEIS frontend

A265340 Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).

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

Offset: 0

Antti Karttunen, Dec 18 2015

nonn

Also the number of significant digits in the binary representation of A263273(n).

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

Cf. A070939, A263273, A265330, A265336, A265337, A265339.

a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).
a(0) = 0; for n >= 1, a(n) = A070939(A263273(n)).
a(n) = A265336(n) + A265337(n).

A265336 Number of nonleading 0-bits in bijective base-3 reversal of n: a(n) = A080791(A263273(n)).

Original entry on oeis.org

0, 0, 1, 0, 2, 0, 1, 1, 3, 2, 2, 2, 2, 1, 2, 2, 4, 2, 3, 1, 3, 0, 1, 1, 3, 3, 2, 1, 2, 1, 1, 3, 6, 2, 2, 4, 4, 0, 2, 2, 4, 4, 5, 3, 4, 0, 4, 1, 4, 2, 4, 3, 3, 2, 2, 1, 3, 4, 3, 5, 2, 1, 4, 2, 5, 1, 3, 3, 5, 4, 3, 3, 5, 3, 1, 2, 3, 3, 3, 2, 5, 4, 4, 4, 4, 2, 2, 4, 6, 3, 3, 2, 4, 1, 2, 3, 6, 5, 4, 3, 4, 3, 5, 0, 5, 2, 4, 2, 3, 3, 4, 2, 4, 5, 3, 4, 3, 2, 2, 2, 3, 2, 4, 4, 5, 3, 4, 2, 4

Offset: 0

Antti Karttunen, Dec 18 2015

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

Cf. A080791, A263273, A265337, A265339, A265340.

a(n) = A080791(A263273(n)).
a(0) = 0, a(2n) = 1 + a(A265339(n)), a(2n+1) = a(A265339(n)).
a(n) = A265340(n) - A265337(n).

A265337 Number of 1-bits in base-3 reversal of n: a(n) = A000120(A263273(n)).

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Dec 18 2015

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

Cf. A000120, A263273, A265336, A265339, A265340.

(definec (A265337 n) (if (zero? n) 0 (+ (A265337 (A265339 n)) (if (odd? n) 1 0))))

a(n) = A000120(A263273(n)).
a(0) = 0, a(2n) = a(A265339(n)), a(2n+1) = 1 + a(A265339(n)).
a(n) = A265340(n) - A265336(n).

cp's OEIS Frontend

A265340 Number of iterations of A265339 needed to reach zero; a(0) = 0; for n >= 1, a(n) = 1 + a(A265339(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A265336 Number of nonleading 0-bits in bijective base-3 reversal of n: a(n) = A080791(A263273(n)).

Views

Author

Keywords

Links

Crossrefs

Formula

A265337 Number of 1-bits in base-3 reversal of n: a(n) = A000120(A263273(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula