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 A247716 #7 Sep 25 2014 21:46:11 %S A247716 14563,17259,19417,20455,21845,25889,27273,30683,34519,38835,40911, %T A247716 46025,51779,54547,58253,61367,64647,69037,72729,77669,81821,92049, %U A247716 92051,96971,103557,107623,109093,109095,122733,129295,138077,143497,145457,145459,153243,155341,161435 %N A247716 Odd numbers n containing 65536 as the highest power of 2 in their Collatz (3x+1) iteration. %C A247716 a(n)*2^k also contains 65536 as the highest power of 2 for any k >= 0. %o A247716 (PARI) %o A247716 Max2(n)=v=[n]; while(n!=1, if(n==Mod(0, 2), n=n/2; v=concat(v, n)); if(n==Mod(1, 2)&&n!=1, n=3*n+1; v=concat(v, n))); k=1; while(vecsearch(vecsort(v), 2^k), k++); 2^(k-1) %o A247716 n=1; while(n<10^4, if(n%2&&Max2(n)==65536, print1(n, ", ")); n++) %Y A247716 Cf. A008908, A010120. %K A247716 nonn %O A247716 1,1 %A A247716 _Derek Orr_, Sep 22 2014