The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174539 Starting numbers n such that the number of halving and tripling steps to reach 1 under the Collatz 3x+1 map is a perfect square. 0
 1, 2, 7, 12, 13, 16, 44, 45, 46, 80, 84, 85, 98, 99, 100, 101, 102, 107, 129, 153, 156, 157, 158, 169, 272, 276, 277, 280, 282, 300, 301, 302, 350, 351, 512, 576, 592, 608, 616, 618, 625, 642, 643, 644, 645, 646, 648, 649, 650, 651, 652, 653, 654, 655, 662, 663 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numbers n such that A006577(n) is a perfect square. LINKS FORMULA {n: A006577(n) in A000290}. EXAMPLE 44, 45 and 46 are in the sequence because the number of steps as counted in A006577 for each of them is 16 = 4^2, a perfect square. MAPLE with(numtheory):for x from 1 to 200 do traj:=0: n1:=x: x1:=x: for p from 1 to 20 while(irem(x1, 2)=0)do p1:=2^p: xx1:=x1: x1:=floor(n1/p1): traj:=traj+1:od: n:=x1: for q from 1 to 100 while(n<>1)do n1:=3*n+1: traj:=traj+1: x0:=irem(n1, 2): for p from 1 to 20 while(x0=0)do p1:=2^p: xx1:=x1: x1:=floor(n1/p1): x0:=n1-p1*x1: traj:=traj+1: od: traj:=traj-1: n:=xx1:od: if(sqrt(traj))=floor(sqrt(traj)) then print(x):else fi:od: CROSSREFS Cf. A006577, A008908, A064433, A006666, A006667, A033491 Sequence in context: A110949 A226703 A126343 * A049409 A287580 A326231 Adjacent sequences:  A174536 A174537 A174538 * A174540 A174541 A174542 KEYWORD nonn AUTHOR Michel Lagneau, Mar 21 2010 EXTENSIONS Unspecific references removed - R. J. Mathar, Mar 31 2010 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 20:36 EST 2020. Contains 330987 sequences. (Running on oeis4.)