login
Similar to A080799 but count only division steps.
1

%I #6 Oct 01 2013 17:57:35

%S 4,4,5,5,5,5,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,

%T 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,

%U 9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9

%N Similar to A080799 but count only division steps.

%H Cino Hilliard, <a href="http://groups.msn.com/BC2LCC/page.msnw?fc_p=%2Fkx%2Bp%20problems&amp;fc_a=0">The x+1 conjecture</a>

%o (PARI) xpcount2(n,p) = { for(x=1,n, p1 = x; f=0; ct=0; while(p1>1, if(p1%2==0,p1/=2; ct++,p1 = p1*p+1;); if(p1==7, p2=7; if(p2%2==0,p2/=2,p2 = p2*p+1); if(p2 ==8 && p1 ==7,f=1) ); ); if(f,print1(ct" ")) ) }

%K easy,nonn

%O 1,1

%A _Cino Hilliard_, Mar 25 2003