|
Search: id:A049067
|
|
|
| A049067 |
|
LaBar's conjecture (steps to return n to 1 after division by 3 and, if needed, multiplication by 2, addition of 1 or 2). |
|
+0
2
|
|
| 18, 44, 4, 216, 34, 50, 181, 68, 13, 126, 125, 228, 278, 256, 49, 364, 82, 68, 180, 575, 202, 1033, 245, 92, 403, 140, 40, 520, 499, 156, 872, 214, 158, 1400, 221, 264, 399, 368, 317, 1157, 390, 298, 648, 376, 94, 594, 1155, 412, 1983, 500, 133, 808, 226, 122
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
LaBar, School Science and Mathematics, Problem #3929, Dec 1982, vol. 82 no 8, page 715.
Enoch Haga, School Science and Mathematics, Nov 1983, vol. 83, no 7, page 628.
|
|
FORMULA
|
f=1\n=n+1:a=n\x=n/3\ (Case 1) if int(x)=x then o=o+1:n=x:s=s+n: if n=1 then print s+t+a:e=0:o=0:s=0:t=0:n=a:return to n=n+1\if n<>1 then return to x=n/3\ (Case 2) if int(x)<>x then e=e+1\if f=1 then y=n*2+2:f=0:n=y:t=t+n:else y=n*2+1:f=1\n=y:t=t+n\if n=1 then print s+t+a:return to n=n+1:else return to x=n/3
|
|
EXAMPLE
|
Beginning at n=1, algorithm produces s+t+a=18
|
|
CROSSREFS
|
Cf. A049074.
Sequence in context: A044095 A044476 A045264 this_sequence A114814 A095739 A055577
Adjacent sequences: A049064 A049065 A049066 this_sequence A049068 A049069 A049070
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
