

A260592


a(n) = binary odd/even encoding of the iterates in the modified Syracuse algorithm (msa) starting with 2n+1 and continuing up to (but not including) the first iterate less than 2n+1.


1



1100, 10, 1110100, 10, 11010, 10, 1111000, 10, 1100, 10, 11100, 10, 11011111010110111011110100111011011111100111100010101000100, 10, 11111010110111011110100111011011111100111100010101000100, 10, 1100, 10, 11101100, 10, 11010, 10
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

For the msa mapping see A260590; if x is odd append 1 and if x is even append 0.
The binary length of a(n) is A260590(n).
For even numbers, 2n, append to f(n) a 0. Example: f(10) = 0, f(5) = 010.
Tallying all the ones and zeros, there appear to be five ones for every four zeros.
Terms sorted in increasing order and duplicates removed: 10, 1100, 11010, 11100, 1101100, 1110100, 1111000, ...
Since msa always starts with an odd number every binary encoding starts with digit 1 and has at least two digits.  Hartmut F. W. Hoft, Nov 05 2015


LINKS

Table of n, a(n) for n=1..22.


FORMULA

a(n) = b_1 b_2 ... b_k, the binary kdigit number where b_j = 1 when the jth iterate of msa is odd and b_j = 0 when it is even, where the first k iterates exceed 2n+1, but the (k+1)st iterate is less than 2n+1.  Hartmut F. W. Hoft, Nov 05 2015


EXAMPLE

a(1) = 1100 since A260590(1) is 4, the four operations are, in order following the msa mapping scheme: (3x+1)/2, (3x+1)/2, x/2, and finishing with a x/2 mapping.


MATHEMATICA

f[n_] := Block[{k = 2n + 1, lst = {}}, While[k > 2n, If[ OddQ@ k, k = (3k + 1)/2; AppendTo[ lst, 1], k /= 2; AppendTo[ lst, 0]]]; FromDigits@ lst]; Array[f, 22]


CROSSREFS

Cf. A005408, A176999, A260590.
Sequence in context: A277797 A278466 A280973 * A278421 A278659 A280612
Adjacent sequences: A260589 A260590 A260591 * A260593 A260594 A260595


KEYWORD

nonn


AUTHOR

Joseph K. Horn and Robert G. Wilson v, Jul 31 2015


EXTENSIONS

Name change by Hartmut F. W. Hoft, Nov 05 2015


STATUS

approved



