|
| |
|
|
A076138
|
|
a(1)=1; a(n+1) is the smallest integer > a(n) such that C_2k(a(n+1))=C_2k(a(n)) for k large enough, where C_m(n) is the modified Collatz map iterated m times on n ( x->x/2 if x is even x->(3x+1)/2 if x is odd).
|
|
0
| |
|
|
1, 4, 5, 6, 11, 14, 15, 19, 20, 21, 24, 25, 26, 27, 33, 34, 35, 43, 44, 45, 46, 47, 56, 57, 58, 59, 60, 61, 62, 63, 64, 72, 74, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 96, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 113, 130, 131, 132, 133, 134, 135
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
