|
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| 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: A175548 A038571 A008687 * A124758 A198328 A071481
Adjacent sequences: A080798 A080799 A080800 * A080802 A080803 A080804
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)gmail.com), Mar 25 2003
|
| |
|
|
