login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A247715
Odd numbers n containing 16384 as the highest power of 2 in the Collatz (3x+1) iteration.
1
5461, 7281, 29125, 38833, 51777, 77667, 103555, 116501, 122731, 138073, 155333, 163641, 184097, 207109, 245463, 276145, 276147, 310669, 327283, 368193, 368195, 414221, 414225, 436377, 466005, 490925, 552291, 552293, 581835, 621333, 654565, 689583, 736387, 736389, 828437, 828451
OFFSET
1,1
COMMENTS
a(n)*2^k also contains 16384 as the highest power of 2 for any k >= 0.
PROG
(PARI)
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)
n=1; while(n<10^4, if(n%2&&Max2(n)==16384, print1(n, ", ")); n++)
CROSSREFS
Sequence in context: A251052 A259514 A217255 * A043580 A104111 A028548
KEYWORD
nonn
AUTHOR
Derek Orr, Sep 22 2014
STATUS
approved