login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080801 Similar to A080799 but count only addition steps. 3
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 (list; graph; refs; listen; history; text; internal format)
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 A290251 A008687 * A124758 A198328 A227277

Adjacent sequences:  A080798 A080799 A080800 * A080802 A080803 A080804

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard, Mar 25 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 12:37 EST 2018. Contains 317402 sequences. (Running on oeis4.)