The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258821 Least number k such that A258772(k) = n. 1
 2, 1, 12, 187561 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS If a(n) exists, a(n) > 10^6 for n > 3. Excluding k = 12, for n = 2, the two fixed points in the trajectory of k occur at 29 and 34 in the section [... 58, 29, 88, 44, 22, 11, 34, 17, 52 ...]. Excluding k = 12, it appears all of the trajectories of the possible k values have length 47 or 48. For n = 3, the three fixed points occur at position 215, 233, and 251 of the trajectory. It appears all of the trajectories of the possible k values have length 316. LINKS EXAMPLE T(12) = [12, 6, 3, 10, 5, 16, 8, 4, 2, 1]. The numbers 3 and 5 are in the 3rd and 5th position, respectively. Since 12 is the smallest number to have exactly two fixed points, a(2) = 12. Note that the length of this trajectory is 10. For all other trajectories with exactly 2 fixed points, the length is either 47 or 48. PROG (PARI) Tvect(n)=v=[n]; while(n!=1, if(n%2, k=3*n+1; v=concat(v, k); n=k); if(!(n%2), k=n/2; v=concat(v, k); n=k)); v n=0; m=1; while(m<10^3, d=Tvect(m); c=0; for(i=1, #d, if(d[i]==i, c++)); if(c==n, print1(m, ", "); m=0; n++); m++) CROSSREFS Cf. A258772, A006370, A070165. Sequence in context: A231611 A171510 A106750 * A124916 A007418 A037271 Adjacent sequences:  A258818 A258819 A258820 * A258822 A258823 A258824 KEYWORD nonn,hard,more,bref AUTHOR Derek Orr, Jun 11 2015 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 September 27 03:21 EDT 2020. Contains 337380 sequences. (Running on oeis4.)