The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 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; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..54. Enoch Haga, Problem, School Science and Mathematics, Nov 1983, vol. 83, no 7, page 628. Sean A. Irvine, Java program (github) LaBar, Problem #3929, School Science and Mathematics, Dec 1982, vol. 82 no 8, page 715. EXAMPLE Beginning at n=1, algorithm produces s+t+a=18. PROG (This was in the formula section but is clearly a program in some language. - N. J. A. Sloane, Apr 18 2017) 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 CROSSREFS Cf. A049074. Sequence in context: A044476 A045264 A297428 * A114814 A299383 A177724 Adjacent sequences: A049064 A049065 A049066 * A049068 A049069 A049070 KEYWORD easy,nonn AUTHOR Enoch Haga STATUS approved

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

Last modified August 13 04:16 EDT 2024. Contains 375113 sequences. (Running on oeis4.)