6 => 6 3 10 5 16 8 4 2 1
8 => 8 4 2 1
1 => 1

6 => 11 13
42 => 59 61
1 => 3 5

QWtQ=Q@,/Q2h*Q3QQ

=Qf!ttP*T+T2hQQ+Q2

ri2*{:N2%N3*)N2/?__p(}g;

ri_2+]{:)_{mp}/&_+((}gS*

l~2*{_2%{3*)}{2/}?_p_(}g;

l~_2+]{:)_{mp}/&!_&}gS*

QWtQ=Q@,/Q2h*3QQQ

~Q1WttP*Q+Q2~Q1;Q+Q2

n->{for(System.out.println(n);n>1;System.out.println(n=n%2<1?n/2:3*n+1));}

n->{t:for(int p,z;;n++){for(z=n;z<n+3;z=z+2)for(p=2;p<z;p++)if(z%p<1)continue t;System.out.print(n+" "+(n+2));break;}}

Print/@(NestWhileList[If[OddQ@#,3#+1,#/2]&,#,#>1&]);&

Print/@(NestWhile[NextPrime,#,!PrimeQ[#+2]&]+{0,2});&

0i:0(?v$a*$'0'-+!
?v6,>:>~:nao:1=?;3*:2%
 >1+^

0i:0(?v$a*$'0'-+!
v&2+1~<:-2
<v!?%&+1:&:v?=&:&:
 >&~0$2&2+v>&~143.
:&:1+&%?!v>:&:&=?v
0v?*r$0~&< .561~&<.1
:<;noan-2

void c(int N){while(N>1){cout<<N<<' ';N=(N%2==0)?N/2:N*3+1;}cout<<N;}

int p(int x){int z=0;for(int i=2;i<x;i++){if(x%i==0){z=1;break;}}return z;}
void c(int N){N=(N%2==0)?N+1:N+2;int M=N+2;while(p(N)+p(M)>0){N=M;M+=2;}cout<<N<<' '<<M;}

int p(int N){int z=0;for(int i=2;i<N;i++){if(N%i==0){z=1;break;}}return z;}
void c(int N){N=(N%2==0)?N+1:N+2;while(p(N)+p(N+2)>0){N+=2;}cout<<N<<' '<<N+2;}

[DÉi3*>ë2÷}Ð,#

[ÅNDÌp#]DÌ)