A265336 -id:A265336 - 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).

A265330 Zero-based row index to A265345; 2-adic valuation of bijective base-3 reversal of n: a(n) = A007814(A263273(n)).

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Dec 18 2015

			For n = 32, in base-3 "1012" [= A007089(32)], when we reverse it, we get "2101" [= A007089(64)], and 2-adic valuation of 64 [= "1000000" = A007088(64)] is 6, thus a(32) = 6.

Antti Karttunen, Table of n, a(n) for n = 1..6561

One less than A265331.
Cf. A007088, A007089, A263273, A265345, A265352.
Cf. A265910 (corresponding other index).
Cf. also A265336, A265337, A265340.
Differs from A007814 for the first time at n=32, where a(32) = 6, while A007814(32) = 5.

a(n) = A007814(A263273(n)).

a(2n+1) = 0, a(2n) = 1 + a(A265352(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

A265330 Zero-based row index to A265345; 2-adic valuation of bijective base-3 reversal of n: a(n) = A007814(A263273(n)).

Views

Author

Keywords

Examples

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