This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A258821 #8 Jun 22 2015 19:03:31 %S A258821 2,1,12,187561 %N A258821 Least number k such that A258772(k) = n. %C A258821 If a(n) exists, a(n) > 10^6 for n > 3. %C A258821 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. %C A258821 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. %e A258821 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. %o A258821 (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 %o A258821 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++) %Y A258821 Cf. A258772, A006370, A070165. %K A258821 nonn,hard,more,bref %O A258821 0,1 %A A258821 _Derek Orr_, Jun 11 2015