cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 1100
2 10
3 1110100
4 10
5 11010
6 10
7 1111000
8 10
9 1100
10 10
11 11100
12 10
13 11011111010110111011110100111011011111100111100010101000100
14 10
15 11111010110111011110100111011011111100111100010101000100
16 10
17 1100
18 10
19 11101100
20 10
21 11010
22 10

List of values

[1100, 10, 1110100, 10, 11010, 10, 1111000, 10, 1100, 10, 11100, 10, 11011111010110111011110100111011011111100111100010101000100, 10, 11111010110111011110100111011011111100111100010101000100, 10, 1100, 10, 11101100, 10, 11010, 10]