A080800 Similar to A080799 but count only division steps.

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, 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, 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

Offset: 1

Author

Cino Hilliard, Mar 25 2003

Keywords

• easy
• nonn

Links

• Cino Hilliard, The x+1 conjecture

Programs

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" ")) ) }