A304027 Table read by rows: T(n, k) is the minimum number of applications of the map (x, y) -> (x + 1, 2*y) or the map (x, y) -> (2*x, y + 1) required to make both numbers in the pair equal, starting from (n, k), 0 <= k <= n.

0, 3, 0, 5, 2, 0, 8, 3, 1, 0, 7, 4, 6, 10, 0, 6, 3, 3, 1, 7, 0, 5, 9, 2, 9, 6, 10, 0, 6, 5, 10, 3, 1, 6, 10, 0, 12, 7, 4, 5, 9, 10, 6, 10, 0, 11, 12, 6, 12, 3, 1, 7, 6, 10, 0, 10, 10, 13, 2, 5, 9, 11, 10, 6, 10, 0, 9, 6, 9, 10, 12, 3, 1, 7, 10, 6, 10, 0, 12

Offset

0,2

Comments

First column is given by A304026.

Links

Peter Kagey, Table of n, a(n) for n = 0..594 (first 33 rows)

Programing Puzzles & Code Golf Stack Exchange, Bringing a pair of integers to equality

Example

T(5, 2) = 3 by the map (*2, +1) followed by two applications of the map (+1, *2): (5,2) -> (10,3) -> (11,6) -> (12,12).
Table begins:
  n\k|    0    1    2    3    4    5    6    7
  ---+----------------------------------------
    0|    0
    1|    3    0
    2|    5    2    0
    3|    8    3    1    0
    4|    7    4    6   10    0
    5|    6    3    3    1    7    0
    6|    5    9    2    9    6   10    0
    7|    6    5   10    3    1    6   10    0

Crossrefs

Cf. A304026.

Sequence in context: A226770 A376625 A185782 * A187886 A324103 A130054

Adjacent sequences: A304024 A304025 A304026 * A304028 A304029 A304030

Keyword

nonn,tabl

Author

Peter Kagey, May 04 2018

Status

approved