For the Collatz (3x+1) iteration starting at k, the sequence lists the smallest k such that Fibonacci(n) belongs to the trajectory of k, or 0 if no such k exists.
A260389
For the Collatz (3x+1) iteration starting at k, the sequence lists the smallest k such that Fibonacci(n) belongs to the trajectory of k, or 0 if no such k exists.
Terms
- a(0) =2a(1) =2a(2) =3a(3) =6a(4) =3a(5) =3a(6) =7a(7) =42a(8) =7a(9) =73a(10) =39a(11) =288a(12) =27a(13) =27a(14) =135a(15) =1974a(16) =1419a(17) =861a(18) =2787a(19) =13530a(20) =7297a(21) =5247a(22) =33963a(23) =92736a(24) =100033a(25) =161857a(26) =116395
External references
- oeis: A260389