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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258828 Least number k such that A258825(k) = n. 1
1, 2, 105, 305 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

If it exists, a(n) > 10^6 for n > 3.

For n = 2, after 17 and 20 iterations, you arrive at 17 and 20, respectively. It appears the total number of iterations of the possible k values is either 26 or 33.

For n = 3, after 14, 17, and 20 iterations, you arrive at 14, 17, and 20, respectively. It appears the total number of iterations of the possible k values is 26.

LINKS

Table of n, a(n) for n=0..3.

EXAMPLE

For n = 105, the Collatz function does the following: 105 -> 158 -> 79 -> 119 -> 179 -> 269 -> 404 -> 202 -> 101 -> 152 -> 76 -> 38 -> 19 -> 29 -> 44 -> 22 -> 11 -> 17 -> 26 -> 13 -> 20 -> 10 -> 5 -> 8 -> 4 -> 2 -> 1. After the 17th and 20th iteration, we can see we reach 17 and 20, respectively. Since 105 is the smallest number to have exactly two occurrences, a(2) = 105. Note that there are 26 iterations before you reach 1. It appears that all numbers with exactly two occurrences have either 26 or 33 total iterations to get to 1.

For n = 305, the Collatz function does the following: 305 -> 458 -> 229 -> 344 -> 172 -> 86 -> 43 -> 65 -> 98 -> 49 -> 74 -> 37 -> 56 -> 28 -> 14 -> 7 -> 11 -> 17 -> 26 -> 13 -> 20 -> 10 -> 5 -> 8 -> 4 -> 2 -> 1. After the 14th, 17th, and 20th iteration, we can see we reach 14, 17, and 20, respectively. Since 305 is the smallest number to have exactly 3 occurrences, a(3) = 305. Note that there are 26 iterations before you reach 1. It appears that all numbers with exactly three occurrences have 26 total iterations to get to 1.

PROG

(PARI) Tvect(n)=v=[n]; while(n!=1, if(n%2, k=(3*n+1)/2; 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-1, c++)); if(c==n, print1(m, ", "); m=0; n++); m++)

CROSSREFS

Cf. A258819, A258824, A258825, A014682, A070168.

Sequence in context: A119433 A307227 A042351 * A156880 A280095 A229016

Adjacent sequences:  A258825 A258826 A258827 * A258829 A258830 A258831

KEYWORD

nonn,more,hard,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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 13:43 EDT 2021. Contains 345080 sequences. (Running on oeis4.)