The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A316232 Table read by rows: T(n, k) is the minimum number m such that (m, m) can be reached from A304027(n, k) applications of either (x, y) -> (x + 1, 2*y) or (x, y) -> (2*x, y + 1), starting from (n,k), where 0 <= k <= n. 0
 0, 4, 1, 12, 4, 2, 16, 8, 4, 3, 16, 12, 36, 164, 4, 16, 8, 12, 6, 68, 5, 16, 108, 8, 132, 52, 228, 6, 32, 20, 164, 16, 8, 60, 260, 7, 100, 44, 20, 36, 164, 268, 68, 292, 8, 100, 332, 44, 420, 20, 10, 100, 76, 324, 9, 100, 132, 524, 12, 44, 196, 420, 332, 84 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS T(n, k) is divisible by 4 whenever n or k is even. Conjecture: T(n,k) is the minimum number m such that (m,m) can be reached from any number of applications of these maps. LINKS EXAMPLE T(5, 2) = 12 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|    4    1     2|   12    4    2     3|   16    8    4    3     4|   16   12   36  164    4     5|   16    8   12    6   68    5     6|   16  108    8  132   52  228    6     7|   32   20  164   16    8   60  260    7 CROSSREFS Cf. A304027. Sequence in context: A145369 A145370 A130322 * A212046 A232013 A246943 Adjacent sequences:  A316229 A316230 A316231 * A316233 A316234 A316235 KEYWORD nonn,tabl AUTHOR Peter Kagey, Jun 27 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 24 07:18 EST 2020. Contains 331189 sequences. (Running on oeis4.)