A080801 Similar to A080799 but count only addition steps.

2, 1, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4, 3, 4, 3, 3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 7, 6, 6, 5, 6, 5, 5, 4, 6, 5, 5, 4, 5, 4, 4, 3, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4, 3, 4, 3, 3, 2, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4

Offset

1,1

Links

Table of n, a(n) for n=1..105.

Cino Hilliard, The x+1 conjecture

Formula

a(n) = A008687(n+2) = A023416(n+1) + 1.

Prog

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

Crossrefs

Sequence in context: A038571 A008687 A290251 * A336391 A366798 A366797

Adjacent sequences: A080798 A080799 A080800 * A080802 A080803 A080804

Keyword

easy,nonn

Author

Cino Hilliard, Mar 25 2003

Status

approved